Base | Representation |
---|---|
bin | 1010111011101101011100… |
… | …1010111011000110010101 |
3 | 1120120012010011122222120101 |
4 | 2232323113022323012111 |
5 | 3033422330141143112 |
6 | 41322201023334101 |
7 | 2350324545665302 |
oct | 256732712730625 |
9 | 46505104588511 |
10 | 12020928459157 |
11 | 3915057803a42 |
12 | 14218a0751331 |
13 | 692751546727 |
14 | 2d7b5d30c0a9 |
15 | 15ca5a43a757 |
hex | aeed72bb195 |
12020928459157 has 2 divisors, whose sum is σ = 12020928459158. Its totient is φ = 12020928459156.
The previous prime is 12020928459151. The next prime is 12020928459223. The reversal of 12020928459157 is 75195482902021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11767548108996 + 253380350161 = 3430386^2 + 503369^2 .
It is a cyclic number.
It is not a de Polignac number, because 12020928459157 - 215 = 12020928426389 is a prime.
It is a super-4 number, since 4×120209284591574 (a number of 53 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12020928459098 and 12020928459107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12020928459151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010464229578 + 6010464229579.
It is an arithmetic number, because the mean of its divisors is an integer number (6010464229579).
Almost surely, 212020928459157 is an apocalyptic number.
It is an amenable number.
12020928459157 is a deficient number, since it is larger than the sum of its proper divisors (1).
12020928459157 is an equidigital number, since it uses as much as digits as its factorization.
12020928459157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3628800, while the sum is 55.
The spelling of 12020928459157 in words is "twelve trillion, twenty billion, nine hundred twenty-eight million, four hundred fifty-nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •