Base | Representation |
---|---|
bin | 1001101100010001010001… |
… | …10010110001111010100001 |
3 | 2210110102210200020121112222 |
4 | 10312020220302301322201 |
5 | 10243140103400414131 |
6 | 113154424021200425 |
7 | 4326522651020612 |
oct | 466105062617241 |
9 | 83412720217488 |
10 | 21312312123041 |
11 | 6877556645525 |
12 | 2482576260115 |
13 | bb79860c6784 |
14 | 539742a71c09 |
15 | 26e5aeb3287b |
hex | 136228cb1ea1 |
21312312123041 has 2 divisors, whose sum is σ = 21312312123042. Its totient is φ = 21312312123040.
The previous prime is 21312312122999. The next prime is 21312312123073. The reversal of 21312312123041 is 14032121321312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18017647878400 + 3294664244641 = 4244720^2 + 1815121^2 .
It is a cyclic number.
It is not a de Polignac number, because 21312312123041 - 230 = 21311238381217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21312312123041.
It is not a weakly prime, because it can be changed into another prime (21312312123941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10656156061520 + 10656156061521.
It is an arithmetic number, because the mean of its divisors is an integer number (10656156061521).
Almost surely, 221312312123041 is an apocalyptic number.
It is an amenable number.
21312312123041 is a deficient number, since it is larger than the sum of its proper divisors (1).
21312312123041 is an equidigital number, since it uses as much as digits as its factorization.
21312312123041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 21312312123041 its reverse (14032121321312), we get a palindrome (35344433444353).
The spelling of 21312312123041 in words is "twenty-one trillion, three hundred twelve billion, three hundred twelve million, one hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •