Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …100100100100101011100001 |
3 | 111101012011112100102112000010 |
4 | 113030131100210210223201 |
5 | 101332322233210341001 |
6 | 1000543132300115133 |
7 | 30326026436164344 |
oct | 2714352044445341 |
9 | 441164470375003 |
10 | 102011120012001 |
11 | 2a55a744905622 |
12 | b536531835aa9 |
13 | 44bc7b8434175 |
14 | 1b2951649245b |
15 | bbd823b458d6 |
hex | 5cc750924ae1 |
102011120012001 has 16 divisors (see below), whose sum is σ = 144091456841088. Its totient is φ = 63973307040000.
The previous prime is 102011120011993. The next prime is 102011120012003. The reversal of 102011120012001 is 100210021110201.
It is not a de Polignac number, because 102011120012001 - 23 = 102011120011993 is a prime.
It is a super-2 number, since 2×1020111200120012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102011120012003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 525999325 + ... + 526193226.
It is an arithmetic number, because the mean of its divisors is an integer number (9005716052568).
Almost surely, 2102011120012001 is an apocalyptic number.
It is an amenable number.
102011120012001 is a deficient number, since it is larger than the sum of its proper divisors (42080336829087).
102011120012001 is a wasteful number, since it uses less digits than its factorization.
102011120012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1052194472.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102011120012001 its reverse (100210021110201), we get a palindrome (202221141122202).
The spelling of 102011120012001 in words is "one hundred two trillion, eleven billion, one hundred twenty million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •