Base | Representation |
---|---|
bin | 111100011100001… |
… | …001100001101010 |
3 | 2121200001010222101 |
4 | 330130021201222 |
5 | 4034041341020 |
6 | 244341444014 |
7 | 34061650144 |
oct | 7434114152 |
9 | 2550033871 |
10 | 1014012010 |
11 | 480424260 |
12 | 24371060a |
13 | 132104c0b |
14 | 98957c94 |
15 | 5e04d00a |
hex | 3c70986a |
1014012010 has 32 divisors (see below), whose sum is σ = 2044973952. Its totient is φ = 358764480.
The previous prime is 1014012001. The next prime is 1014012019. The reversal of 1014012010 is 102104101.
It is an interprime number because it is at equal distance from previous prime (1014012001) and next prime (1014012019).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (1014012019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120502 + ... + 128641.
It is an arithmetic number, because the mean of its divisors is an integer number (63905436).
Almost surely, 21014012010 is an apocalyptic number.
1014012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1014012010 is an abundant number, since it is smaller than the sum of its proper divisors (1030961942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1014012010 is a wasteful number, since it uses less digits than its factorization.
1014012010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249198.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1014012010 is about 31843.5552349294. Note that the first 3 decimals coincide. The cubic root of 1014012010 is about 1004.6490230905.
Adding to 1014012010 its reverse (102104101), we get a palindrome (1116116111).
The spelling of 1014012010 in words is "one billion, fourteen million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •