Base | Representation |
---|---|
bin | 11101011101000000000… |
… | …01010000110001001111 |
3 | 10120202011011022012020202 |
4 | 32232200001100301033 |
5 | 113040040002444301 |
6 | 2052523551004115 |
7 | 133054232032355 |
oct | 16564001206117 |
9 | 3522134265222 |
10 | 1012001999951 |
11 | 360207823118 |
12 | 14417150963b |
13 | 7457b980767 |
14 | 36da44257d5 |
15 | 1b4d027e66b |
hex | eba0050c4f |
1012001999951 has 2 divisors, whose sum is σ = 1012001999952. Its totient is φ = 1012001999950.
The previous prime is 1012001999947. The next prime is 1012002000013. The reversal of 1012001999951 is 1599991002101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1012001999951 - 22 = 1012001999947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012001999896 and 1012001999905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012001999651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506000999975 + 506000999976.
It is an arithmetic number, because the mean of its divisors is an integer number (506000999976).
Almost surely, 21012001999951 is an apocalyptic number.
1012001999951 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012001999951 is an equidigital number, since it uses as much as digits as its factorization.
1012001999951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65610, while the sum is 47.
The spelling of 1012001999951 in words is "one trillion, twelve billion, one million, nine hundred ninety-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •