Base | Representation |
---|---|
bin | 111100010101100… |
… | …111011010001000 |
3 | 2121112211010201101 |
4 | 330111213122020 |
5 | 4033122040100 |
6 | 244241031144 |
7 | 34041255130 |
oct | 7425473210 |
9 | 2545733641 |
10 | 1012299400 |
11 | 47a464582 |
12 | 2430254b4 |
13 | 131955538 |
14 | 9862dac0 |
15 | 5dd1086a |
hex | 3c567688 |
1012299400 has 48 divisors (see below), whose sum is σ = 2689827840. Its totient is φ = 347073600.
The previous prime is 1012299377. The next prime is 1012299401. The reversal of 1012299400 is 49922101.
It is a happy number.
1012299400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (1012299401) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 360136 + ... + 362935.
It is an arithmetic number, because the mean of its divisors is an integer number (56038080).
Almost surely, 21012299400 is an apocalyptic number.
1012299400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012299400 is an abundant number, since it is smaller than the sum of its proper divisors (1677528440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012299400 is a wasteful number, since it uses less digits than its factorization.
1012299400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723094 (or 723085 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 1012299400 is about 31816.6528723560. The cubic root of 1012299400 is about 1004.0831055582.
The spelling of 1012299400 in words is "one billion, twelve million, two hundred ninety-nine thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •