Base | Representation |
---|---|
bin | 1010111101001010111000… |
… | …0100011110111010010101 |
3 | 1120122120212001120200010201 |
4 | 2233102232010132322111 |
5 | 3034330211212140012 |
6 | 41341505432220501 |
7 | 2352203216412442 |
oct | 257225604367225 |
9 | 46576761520121 |
10 | 12046008708757 |
11 | 3924757971751 |
12 | 142671bb3a731 |
13 | 694c1a599aca |
14 | 2d905c1c49c9 |
15 | 15d5271b0857 |
hex | af4ae11ee95 |
12046008708757 has 2 divisors, whose sum is σ = 12046008708758. Its totient is φ = 12046008708756.
The previous prime is 12046008708749. The next prime is 12046008708781. The reversal of 12046008708757 is 75780780064021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12014916792516 + 31091916241 = 3466254^2 + 176329^2 .
It is a cyclic number.
It is not a de Polignac number, because 12046008708757 - 23 = 12046008708749 is a prime.
It is a super-2 number, since 2×120460087087572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12046008708698 and 12046008708707.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12046008708457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6023004354378 + 6023004354379.
It is an arithmetic number, because the mean of its divisors is an integer number (6023004354379).
Almost surely, 212046008708757 is an apocalyptic number.
It is an amenable number.
12046008708757 is a deficient number, since it is larger than the sum of its proper divisors (1).
12046008708757 is an equidigital number, since it uses as much as digits as its factorization.
12046008708757 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5268480, while the sum is 55.
The spelling of 12046008708757 in words is "twelve trillion, forty-six billion, eight million, seven hundred eight thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •