Base | Representation |
---|---|
bin | 11101111110110001010… |
… | …01110101101010101011 |
3 | 10122110221200011011010201 |
4 | 32333120221311222223 |
5 | 113334202244430443 |
6 | 2105123000253031 |
7 | 134265426532240 |
oct | 16773051655253 |
9 | 3573850134121 |
10 | 1030132030123 |
11 | 367970748129 |
12 | 147791171177 |
13 | 761aab0a471 |
14 | 37c0421d5c7 |
15 | 1bbe1c7034d |
hex | efd8a75aab |
1030132030123 has 8 divisors (see below), whose sum is σ = 1183798135520. Its totient is φ = 878092021440.
The previous prime is 1030132030043. The next prime is 1030132030127. The reversal of 1030132030123 is 3210302310301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030132030123 - 213 = 1030132021931 is a prime.
It is a super-2 number, since 2×10301320301232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030132030123.
It is not an unprimeable number, because it can be changed into a prime (1030132030127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 406522818 + ... + 406525351.
It is an arithmetic number, because the mean of its divisors is an integer number (147974766940).
Almost surely, 21030132030123 is an apocalyptic number.
1030132030123 is a deficient number, since it is larger than the sum of its proper divisors (153666105397).
1030132030123 is an equidigital number, since it uses as much as digits as its factorization.
1030132030123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813048357.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1030132030123 its reverse (3210302310301), we get a palindrome (4240434340424).
The spelling of 1030132030123 in words is "one trillion, thirty billion, one hundred thirty-two million, thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •