Base | Representation |
---|---|
bin | 1001000110101111000101… |
… | …0110111110000100010100 |
3 | 1022110001222022200212021110 |
4 | 2101223301112332010110 |
5 | 2303011142210131012 |
6 | 33143045515015020 |
7 | 2052202630353432 |
oct | 221536126760424 |
9 | 38401868625243 |
10 | 10011323130132 |
11 | 320a861a04305 |
12 | 1158317a3a470 |
13 | 5780a9cbba1c |
14 | 26879ccb3d52 |
15 | 12563e05e73c |
hex | 91af15be114 |
10011323130132 has 48 divisors (see below), whose sum is σ = 24757391316672. Its totient is φ = 3137818790400.
The previous prime is 10011323130121. The next prime is 10011323130157. The reversal of 10011323130132 is 23103132311001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10011323130099 and 10011323130108.
It is a congruent number.
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, 23132463 + ... + 23561270.
It is an arithmetic number, because the mean of its divisors is an integer number (515778985764).
Almost surely, 210011323130132 is an apocalyptic number.
10011323130132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10011323130132 is an abundant number, since it is smaller than the sum of its proper divisors (14746068186540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011323130132 is a wasteful number, since it uses less digits than its factorization.
10011323130132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46694808 (or 46694806 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10011323130132 its reverse (23103132311001), we get a palindrome (33114455441133).
The spelling of 10011323130132 in words is "ten trillion, eleven billion, three hundred twenty-three million, one hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •