Base | Representation |
---|---|
bin | 11110110000101011110… |
… | …11101101000000100001 |
3 | 10202001010021010101002022 |
4 | 33120111323231000201 |
5 | 114304043030132301 |
6 | 2125314044231225 |
7 | 136234465102121 |
oct | 17302573550041 |
9 | 3661107111068 |
10 | 1056929927201 |
11 | 378272431905 |
12 | 150a0b83b515 |
13 | 7888b9787b5 |
14 | 39227292c81 |
15 | 1c75e6d2d1b |
hex | f615eed021 |
1056929927201 has 2 divisors, whose sum is σ = 1056929927202. Its totient is φ = 1056929927200.
The previous prime is 1056929927197. The next prime is 1056929927239. The reversal of 1056929927201 is 1027299296501.
It is a happy number.
1056929927201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1041983642176 + 14946285025 = 1020776^2 + 122255^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056929927201 - 22 = 1056929927197 is a prime.
It is a super-2 number, since 2×10569299272012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1056929923201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528464963600 + 528464963601.
It is an arithmetic number, because the mean of its divisors is an integer number (528464963601).
Almost surely, 21056929927201 is an apocalyptic number.
It is an amenable number.
1056929927201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056929927201 is an equidigital number, since it uses as much as digits as its factorization.
1056929927201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1224720, while the sum is 53.
The spelling of 1056929927201 in words is "one trillion, fifty-six billion, nine hundred twenty-nine million, nine hundred twenty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •