Base | Representation |
---|---|
bin | 10010101001110001… |
… | …10110010110001101 |
3 | 221211220100011210110 |
4 | 21110320312112031 |
5 | 131002103422110 |
6 | 4333405230233 |
7 | 503105434026 |
oct | 112470662615 |
9 | 27756304713 |
10 | 10014123405 |
11 | 4279791150 |
12 | 1b35862379 |
13 | c378c3b10 |
14 | 6add9bc4d |
15 | 3d924ca20 |
hex | 254e3658d |
10014123405 has 32 divisors (see below), whose sum is σ = 18823754880. Its totient is φ = 4481844480.
The previous prime is 10014123401. The next prime is 10014123407. The reversal of 10014123405 is 50432141001.
10014123405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10014123405 - 22 = 10014123401 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10014123401) 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 in 31 ways as a sum of consecutive naturals, for example, 2332150 + ... + 2336439.
It is an arithmetic number, because the mean of its divisors is an integer number (588242340).
Almost surely, 210014123405 is an apocalyptic number.
10014123405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10014123405 is a deficient number, since it is larger than the sum of its proper divisors (8809631475).
10014123405 is a wasteful number, since it uses less digits than its factorization.
10014123405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4668621.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 10014123405 its reverse (50432141001), we get a palindrome (60446264406).
The spelling of 10014123405 in words is "ten billion, fourteen million, one hundred twenty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •