Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0100011010110100010 |
3 | 100122222200111112210200 |
4 | 1132022300203112202 |
5 | 3124034212400310 |
6 | 114241134010030 |
7 | 10206440533305 |
oct | 1361260432642 |
9 | 318880445720 |
10 | 101112231330 |
11 | 39977244a50 |
12 | 1771a346916 |
13 | 96c50837a6 |
14 | 4c72a64b3c |
15 | 296bbd99c0 |
hex | 178ac235a2 |
101112231330 has 48 divisors (see below), whose sum is σ = 286791058944. Its totient is φ = 24512055840.
The previous prime is 101112231299. The next prime is 101112231349. The reversal of 101112231330 is 33132211101.
101112231330 is a `hidden beast` number, since 1 + 0 + 111 + 223 + 1 + 330 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 51065794 + ... + 51067773.
It is an arithmetic number, because the mean of its divisors is an integer number (5974813728).
Almost surely, 2101112231330 is an apocalyptic number.
101112231330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101112231330 is an abundant number, since it is smaller than the sum of its proper divisors (185678827614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112231330 is a wasteful number, since it uses less digits than its factorization.
101112231330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102133591 (or 102133588 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 101112231330 its reverse (33132211101), we get a palindrome (134244442431).
The spelling of 101112231330 in words is "one hundred one billion, one hundred twelve million, two hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •