Base | Representation |
---|---|
bin | 11001111000000000100000… |
… | …11111000011000111101011 |
3 | 21110110120212001201011122001 |
4 | 30330000100133003013223 |
5 | 24424222201321441412 |
6 | 321003300050511431 |
7 | 14661614061026164 |
oct | 1474002037030753 |
9 | 243416761634561 |
10 | 56900003312107 |
11 | 1714817954280a |
12 | 646b727b95577 |
13 | 259985512b5a7 |
14 | 1009d9100276b |
15 | 68a17657a957 |
hex | 33c0107c31eb |
56900003312107 has 2 divisors, whose sum is σ = 56900003312108. Its totient is φ = 56900003312106.
The previous prime is 56900003312093. The next prime is 56900003312267. The reversal of 56900003312107 is 70121330000965.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56900003312107 - 27 = 56900003311979 is a prime.
It is a super-2 number, since 2×569000033121072 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56900003312507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28450001656053 + 28450001656054.
It is an arithmetic number, because the mean of its divisors is an integer number (28450001656054).
Almost surely, 256900003312107 is an apocalyptic number.
56900003312107 is a deficient number, since it is larger than the sum of its proper divisors (1).
56900003312107 is an equidigital number, since it uses as much as digits as its factorization.
56900003312107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 37.
The spelling of 56900003312107 in words is "fifty-six trillion, nine hundred billion, three million, three hundred twelve thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •