Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101011001101101100110010 |
3 | 111021210001200222000021020010 |
4 | 113002203000223031230302 |
5 | 101240143021324013020 |
6 | 555302223351155350 |
7 | 30225600236124240 |
oct | 2702430053155462 |
9 | 437701628007203 |
10 | 101330101001010 |
11 | 2a317944387a02 |
12 | b446551975b56 |
13 | 447050650978b |
14 | 1b0458ddb7790 |
15 | baac6611ede0 |
hex | 5c28c0acdb32 |
101330101001010 has 256 divisors, whose sum is σ = 296474126192640. Its totient is φ = 21636488847360.
The previous prime is 101330101001009. The next prime is 101330101001023. The reversal of 101330101001010 is 10100101033101.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 5228851501 + ... + 5228870879.
It is an arithmetic number, because the mean of its divisors is an integer number (1158102055440).
Almost surely, 2101330101001010 is an apocalyptic number.
101330101001010 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 101330101001010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148237063096320).
101330101001010 is an abundant number, since it is smaller than the sum of its proper divisors (195144025191630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101330101001010 is a wasteful number, since it uses less digits than its factorization.
101330101001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30241.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 101330101001010 its reverse (10100101033101), we get a palindrome (111430202034111).
The spelling of 101330101001010 in words is "one hundred one trillion, three hundred thirty billion, one hundred one million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •