Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01010011101010001 |
3 | 222011001111022200210 |
4 | 21123313022131101 |
5 | 131222031401001 |
6 | 4353145034333 |
7 | 506026054560 |
oct | 113367123521 |
9 | 28131438623 |
10 | 10131122001 |
11 | 4329832a00 |
12 | 1b68a859a9 |
13 | c55c09860 |
14 | 6c1735bd7 |
15 | 3e465ddd6 |
hex | 25bdca751 |
10131122001 has 96 divisors (see below), whose sum is σ = 19350261504. Its totient is φ = 4572057600.
The previous prime is 10131121991. The next prime is 10131122009. The reversal of 10131122001 is 10022113101.
10131122001 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10131122001 - 25 = 10131121969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10131122009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 552541 + ... + 570581.
It is an arithmetic number, because the mean of its divisors is an integer number (201565224).
Almost surely, 210131122001 is an apocalyptic number.
10131122001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10131122001 is a deficient number, since it is larger than the sum of its proper divisors (9219139503).
10131122001 is a wasteful number, since it uses less digits than its factorization.
10131122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18103 (or 18092 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10131122001 its reverse (10022113101), we get a palindrome (20153235102).
The spelling of 10131122001 in words is "ten billion, one hundred thirty-one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •