Base | Representation |
---|---|
bin | 11101101000011101000010… |
… | …000100010110110111101000 |
3 | 122002102210012221001220001212 |
4 | 131220131002010112313220 |
5 | 114040204110040213112 |
6 | 1141101410434332252 |
7 | 36310355614550234 |
oct | 3550350204266750 |
9 | 562383187056055 |
10 | 130323301101032 |
11 | 3858588aa4a616 |
12 | 12749641a2a088 |
13 | 5794585967c30 |
14 | 2427977bab5c4 |
15 | 101001c6e2522 |
hex | 768742116de8 |
130323301101032 has 64 divisors (see below), whose sum is σ = 272230867560960. Its totient is φ = 58082651308800.
The previous prime is 130323301101011. The next prime is 130323301101067. The reversal of 130323301101032 is 230101103323031.
It is a junction number, because it is equal to n+sod(n) for n = 130323301100989 and 130323301101007.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42356318 + ... + 45328845.
It is an arithmetic number, because the mean of its divisors is an integer number (4253607305640).
Almost surely, 2130323301101032 is an apocalyptic number.
It is an amenable number.
130323301101032 is an abundant number, since it is smaller than the sum of its proper divisors (141907566459928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130323301101032 is a wasteful number, since it uses less digits than its factorization.
130323301101032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87685674 (or 87685670 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 130323301101032 its reverse (230101103323031), we get a palindrome (360424404424063).
The spelling of 130323301101032 in words is "one hundred thirty trillion, three hundred twenty-three billion, three hundred one million, one hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •