Base | Representation |
---|---|
bin | 1010111011001001101100… |
… | …0100100001000111100001 |
3 | 1120112021100020212112011211 |
4 | 2232302123010201013201 |
5 | 3033243201013243241 |
6 | 41313532351510121 |
7 | 2346534650146336 |
oct | 256623304410741 |
9 | 46467306775154 |
10 | 12011330212321 |
11 | 3910a81852040 |
12 | 141ba62228341 |
13 | 691881b6282b |
14 | 2d74cc68898d |
15 | 15c69798a781 |
hex | aec9b1211e1 |
12011330212321 has 16 divisors (see below), whose sum is σ = 13318573771008. Its totient is φ = 10739984083200.
The previous prime is 12011330212319. The next prime is 12011330212339. The reversal of 12011330212321 is 12321203311021.
It is a cyclic number.
It is not a de Polignac number, because 12011330212321 - 21 = 12011330212319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011330212292 and 12011330212301.
It is not an unprimeable number, because it can be changed into a prime (12011330215321) 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, 18456745 + ... + 19096441.
It is an arithmetic number, because the mean of its divisors is an integer number (832410860688).
Almost surely, 212011330212321 is an apocalyptic number.
12011330212321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12011330212321 is a deficient number, since it is larger than the sum of its proper divisors (1307243558687).
12011330212321 is a wasteful number, since it uses less digits than its factorization.
12011330212321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 667752.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12011330212321 its reverse (12321203311021), we get a palindrome (24332533523342).
The spelling of 12011330212321 in words is "twelve trillion, eleven billion, three hundred thirty million, two hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.335 sec. • engine limits •