Base | Representation |
---|---|
bin | 101101101101000111000010… |
… | …001010101110100001101011 |
3 | 222100201120011102120222012120 |
4 | 231231013002022232201223 |
5 | 202321340110113341021 |
6 | 1551303351553242323 |
7 | 60224432202426330 |
oct | 5555070212564153 |
9 | 870646142528176 |
10 | 201012022012011 |
11 | 590597a1064861 |
12 | 1a6655875633a3 |
13 | 88214771283a2 |
14 | 378d068978987 |
15 | 1838bb5e732c6 |
hex | b6d1c22ae86b |
201012022012011 has 32 divisors (see below), whose sum is σ = 329931974443008. Its totient is φ = 106325733935520.
The previous prime is 201012022011979. The next prime is 201012022012141. The reversal of 201012022012011 is 110210220210102.
201012022012011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201012022012011 - 25 = 201012022011979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201012022012211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6712468231 + ... + 6712498176.
It is an arithmetic number, because the mean of its divisors is an integer number (10310374201344).
Almost surely, 2201012022012011 is an apocalyptic number.
201012022012011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201012022012011 is a deficient number, since it is larger than the sum of its proper divisors (128919952430997).
201012022012011 is a wasteful number, since it uses less digits than its factorization.
201012022012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13424966471.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201012022012011 its reverse (110210220210102), we get a palindrome (311222242222113).
The spelling of 201012022012011 in words is "two hundred one trillion, twelve billion, twenty-two million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •