Base | Representation |
---|---|
bin | 111101011001010… |
… | …000011100010011 |
3 | 2122210012000001212 |
4 | 331121100130103 |
5 | 4102141443443 |
6 | 250113050335 |
7 | 34345056122 |
oct | 7531203423 |
9 | 2583160055 |
10 | 1030031123 |
11 | 4894756a0 |
12 | 248b569ab |
13 | 135523394 |
14 | 9ab27ab9 |
15 | 60664618 |
hex | 3d650713 |
1030031123 has 16 divisors (see below), whose sum is σ = 1162909440. Its totient is φ = 904082400.
The previous prime is 1030031081. The next prime is 1030031129. The reversal of 1030031123 is 3211300301.
1030031123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1030031123 - 212 = 1030027027 is a prime.
It is a super-2 number, since 2×10300311232 = 2121928228697282258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030031098 and 1030031107.
It is not an unprimeable number, because it can be changed into a prime (1030031129) 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, 43658 + ... + 62976.
It is an arithmetic number, because the mean of its divisors is an integer number (72681840).
Almost surely, 21030031123 is an apocalyptic number.
1030031123 is a deficient number, since it is larger than the sum of its proper divisors (132878317).
1030031123 is a wasteful number, since it uses less digits than its factorization.
1030031123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19498.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 1030031123 is about 32094.0979465072. The cubic root of 1030031123 is about 1009.9118058467.
Adding to 1030031123 its reverse (3211300301), we get a palindrome (4241331424).
The spelling of 1030031123 in words is "one billion, thirty million, thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •