Base | Representation |
---|---|
bin | 1001001101110010001111… |
… | …1001001001000010000110 |
3 | 1022212122120110200222002112 |
4 | 2103130203321021002012 |
5 | 2312002204042024110 |
6 | 33314435112141022 |
7 | 2064021030142124 |
oct | 223344371110206 |
9 | 38778513628075 |
10 | 10132430033030 |
11 | 3257159668a08 |
12 | 1177896397772 |
13 | 58663a602a06 |
14 | 2705ab234914 |
15 | 12887b2b1405 |
hex | 93723e49086 |
10132430033030 has 64 divisors (see below), whose sum is σ = 19425574586880. Its totient is φ = 3798389683200.
The previous prime is 10132430033023. The next prime is 10132430033069. The reversal of 10132430033030 is 3033003423101.
It is a super-2 number, since 2×101324300330302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10132430032987 and 10132430033005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 179435 + ... + 4505225.
It is an arithmetic number, because the mean of its divisors is an integer number (303524602920).
Almost surely, 210132430033030 is an apocalyptic number.
10132430033030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10132430033030 is a deficient number, since it is larger than the sum of its proper divisors (9293144553850).
10132430033030 is a wasteful number, since it uses less digits than its factorization.
10132430033030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4326065.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 10132430033030 its reverse (3033003423101), we get a palindrome (13165433456131).
The spelling of 10132430033030 in words is "ten trillion, one hundred thirty-two billion, four hundred thirty million, thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •