Base | Representation |
---|---|
bin | 10011111011101101… |
… | …01000000011011011 |
3 | 1000121210120202212012 |
4 | 21331312220003123 |
5 | 133404030001202 |
6 | 4525520140135 |
7 | 526122311435 |
oct | 117566500333 |
9 | 30553522765 |
10 | 10701406427 |
11 | 45a1735048 |
12 | 20a7a6764b |
13 | 10170cca6a |
14 | 737385655 |
15 | 42975c152 |
hex | 27dda80db |
10701406427 has 4 divisors (see below), whose sum is σ = 10715004936. Its totient is φ = 10687807920.
The previous prime is 10701406421. The next prime is 10701406451. The reversal of 10701406427 is 72460410701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72460410701 = 7 ⋅10351487243.
It is a cyclic number.
It is not a de Polignac number, because 10701406427 - 24 = 10701406411 is a prime.
It is a super-2 number, since 2×107014064272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10701406393 and 10701406402.
It is not an unprimeable number, because it can be changed into a prime (10701406421) 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 in 3 ways as a sum of consecutive naturals, for example, 6798074 + ... + 6799647.
It is an arithmetic number, because the mean of its divisors is an integer number (2678751234).
Almost surely, 210701406427 is an apocalyptic number.
10701406427 is a deficient number, since it is larger than the sum of its proper divisors (13598509).
10701406427 is an equidigital number, since it uses as much as digits as its factorization.
10701406427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13598508.
The product of its (nonzero) digits is 9408, while the sum is 32.
The spelling of 10701406427 in words is "ten billion, seven hundred one million, four hundred six thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •