Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1110101101100011010 |
3 | 100200111122000020001110 |
4 | 1132112223311230122 |
5 | 3124441423303310 |
6 | 114313042401150 |
7 | 10214420350062 |
oct | 1362653655432 |
9 | 320448006043 |
10 | 101312322330 |
11 | 39a6a18a30a |
12 | 177753601b6 |
13 | 972767032b |
14 | 4c9146c3a2 |
15 | 297e560d20 |
hex | 1796af5b1a |
101312322330 has 64 divisors (see below), whose sum is σ = 252099330048. Its totient is φ = 26029884480.
The previous prime is 101312322313. The next prime is 101312322379. The reversal of 101312322330 is 33223213101.
It is a junction number, because it is equal to n+sod(n) for n = 101312322297 and 101312322306.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28842 + ... + 451061.
It is an arithmetic number, because the mean of its divisors is an integer number (3939052032).
Almost surely, 2101312322330 is an apocalyptic number.
101312322330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101312322330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126049665024).
101312322330 is an abundant number, since it is smaller than the sum of its proper divisors (150787007718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101312322330 is a wasteful number, since it uses less digits than its factorization.
101312322330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 480171.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 101312322330 its reverse (33223213101), we get a palindrome (134535535431).
The spelling of 101312322330 in words is "one hundred one billion, three hundred twelve million, three hundred twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •