Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1000111000100000100 |
3 | 100200111121122112001110 |
4 | 1132112223013010010 |
5 | 3124441401200312 |
6 | 114313034325020 |
7 | 10214415623166 |
oct | 1362653070404 |
9 | 320447575043 |
10 | 101312131332 |
11 | 39a6a069865 |
12 | 17775289770 |
13 | 9727604409 |
14 | 4c9141c936 |
15 | 297e52443c |
hex | 1796ac7104 |
101312131332 has 24 divisors (see below), whose sum is σ = 240270302272. Its totient is φ = 33217092000.
The previous prime is 101312131331. The next prime is 101312131357. The reversal of 101312131332 is 233131213101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101312131299 and 101312131308.
It is not an unprimeable number, because it can be changed into a prime (101312131331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69201544 + ... + 69203007.
Almost surely, 2101312131332 is an apocalyptic number.
101312131332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101312131332 is an abundant number, since it is smaller than the sum of its proper divisors (138958170940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101312131332 is a wasteful number, since it uses less digits than its factorization.
101312131332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138404619 (or 138404617 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 101312131332 its reverse (233131213101), we get a palindrome (334443344433).
The spelling of 101312131332 in words is "one hundred one billion, three hundred twelve million, one hundred thirty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •