Base | Representation |
---|---|
bin | 10011111011101101… |
… | …01000000011110011 |
3 | 1000121210120202220002 |
4 | 21331312220003303 |
5 | 133404030001301 |
6 | 4525520140215 |
7 | 526122311501 |
oct | 117566500363 |
9 | 30553522802 |
10 | 10701406451 |
11 | 45a173506a |
12 | 20a7a6766b |
13 | 10170cca88 |
14 | 737385671 |
15 | 42975c16b |
hex | 27dda80f3 |
10701406451 has 2 divisors, whose sum is σ = 10701406452. Its totient is φ = 10701406450.
The previous prime is 10701406421. The next prime is 10701406459. The reversal of 10701406451 is 15460410701.
It is a strong prime.
It is an emirp because it is prime and its reverse (15460410701) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10701406451 is a prime.
It is a super-2 number, since 2×107014064512 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10701406459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5350703225 + 5350703226.
It is an arithmetic number, because the mean of its divisors is an integer number (5350703226).
Almost surely, 210701406451 is an apocalyptic number.
10701406451 is a deficient number, since it is larger than the sum of its proper divisors (1).
10701406451 is an equidigital number, since it uses as much as digits as its factorization.
10701406451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
The spelling of 10701406451 in words is "ten billion, seven hundred one million, four hundred six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •