Base | Representation |
---|---|
bin | 111110001100010… |
… | …000010101011110 |
3 | 2200201100012202120 |
4 | 332030100111132 |
5 | 4114102300110 |
6 | 251311403410 |
7 | 34566516411 |
oct | 7614202536 |
9 | 2621305676 |
10 | 1043400030 |
11 | 495a76982 |
12 | 251523566 |
13 | 13822448a |
14 | 9c807b78 |
15 | 61905870 |
hex | 3e31055e |
1043400030 has 16 divisors (see below), whose sum is σ = 2504160144. Its totient is φ = 278240000.
The previous prime is 1043399989. The next prime is 1043400053. The reversal of 1043400030 is 300043401.
1043400030 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 (15).
It is a junction number, because it is equal to n+sod(n) for n = 1043399982 and 1043400009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17389971 + ... + 17390030.
It is an arithmetic number, because the mean of its divisors is an integer number (156510009).
Almost surely, 21043400030 is an apocalyptic number.
1043400030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1043400030 is an abundant number, since it is smaller than the sum of its proper divisors (1460760114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043400030 is a wasteful number, since it uses less digits than its factorization.
1043400030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34780011.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 1043400030 is about 32301.7032058683. The cubic root of 1043400030 is about 1014.2622965187.
Adding to 1043400030 its reverse (300043401), we get a palindrome (1343443431).
The spelling of 1043400030 in words is "one billion, forty-three million, four hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •