Base | Representation |
---|---|
bin | 10011000000000100… |
… | …01111000000111000 |
3 | 222022221020020212220 |
4 | 21200002033000320 |
5 | 131342442224422 |
6 | 4404125404040 |
7 | 510536125602 |
oct | 114002170070 |
9 | 28287206786 |
10 | 10201133112 |
11 | 4365301325 |
12 | 1b88409620 |
13 | c67580451 |
14 | 6cab5c172 |
15 | 3ea88ce5c |
hex | 26008f038 |
10201133112 has 32 divisors (see below), whose sum is σ = 25523164800. Its totient is φ = 3397666784.
The previous prime is 10201133087. The next prime is 10201133113. The reversal of 10201133112 is 21133110201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10201133091 and 10201133100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201133113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138588 + ... + 199019.
It is an arithmetic number, because the mean of its divisors is an integer number (797598900).
Almost surely, 210201133112 is an apocalyptic number.
10201133112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10201133112 is an abundant number, since it is smaller than the sum of its proper divisors (15322031688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201133112 is a wasteful number, since it uses less digits than its factorization.
10201133112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338875 (or 338871 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10201133112 its reverse (21133110201), we get a palindrome (31334243313).
The spelling of 10201133112 in words is "ten billion, two hundred one million, one hundred thirty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •