Base | Representation |
---|---|
bin | 1010111011101010010111… |
… | …0110111000001111110011 |
3 | 1120120002222111212211222211 |
4 | 2232322211312320033303 |
5 | 3033414131341333021 |
6 | 41321542550512551 |
7 | 2350265211510604 |
oct | 256724566701763 |
9 | 46502874784884 |
10 | 12020101121011 |
11 | 39147727a0605 |
12 | 14216ab665757 |
13 | 69264c011329 |
14 | 2d7ac14a7dab |
15 | 15ca0c9b33e1 |
hex | aeea5db83f3 |
12020101121011 has 8 divisors (see below), whose sum is σ = 12053005850160. Its totient is φ = 11987238934272.
The previous prime is 12020101120943. The next prime is 12020101121047. The reversal of 12020101121011 is 11012110102021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12020101121011 - 213 = 12020101112819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12020101120982 and 12020101121000.
It is not an unprimeable number, because it can be changed into a prime (12020101121081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10069701 + ... + 11199958.
It is an arithmetic number, because the mean of its divisors is an integer number (1506625731270).
Almost surely, 212020101121011 is an apocalyptic number.
12020101121011 is a deficient number, since it is larger than the sum of its proper divisors (32904729149).
12020101121011 is an equidigital number, since it uses as much as digits as its factorization.
12020101121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21271205.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12020101121011 its reverse (11012110102021), we get a palindrome (23032211223032).
The spelling of 12020101121011 in words is "twelve trillion, twenty billion, one hundred one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •