Base | Representation |
---|---|
bin | 1010111011101010011001… |
… | …1001001000101001101110 |
3 | 1120120010000010210002100210 |
4 | 2232322212121020221232 |
5 | 3033414141141213402 |
6 | 41321543511203250 |
7 | 2350265351031615 |
oct | 256724631105156 |
9 | 46503003702323 |
10 | 12020110101102 |
11 | 3914777874474 |
12 | 14216b2676526 |
13 | 692650b368ac |
14 | 2d7ac276487c |
15 | 15ca0d68906c |
hex | aeea6648a6e |
12020110101102 has 8 divisors (see below), whose sum is σ = 24040220202216. Its totient is φ = 4006703367032.
The previous prime is 12020110100959. The next prime is 12020110101143. The reversal of 12020110101102 is 20110101102021.
It is a sphenic number, since it is the product of 3 distinct primes.
12020110101102 is an admirable number.
It is a super-2 number, since 2×120201101011022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1001675841753 + ... + 1001675841764.
It is an arithmetic number, because the mean of its divisors is an integer number (3005027525277).
Almost surely, 212020110101102 is an apocalyptic number.
12020110101102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12020110101102 is a wasteful number, since it uses less digits than its factorization.
12020110101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003351683522.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12020110101102 its reverse (20110101102021), we get a palindrome (32130211203123).
The spelling of 12020110101102 in words is "twelve trillion, twenty billion, one hundred ten million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •