Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …10001110111111010011 |
3 | 10112201000101122220001102 |
4 | 32210112032032333103 |
5 | 112400223123211011 |
6 | 2043522111455015 |
7 | 132220124245520 |
oct | 16442616167723 |
9 | 3481011586042 |
10 | 1001100210131 |
11 | 356622a7406a |
12 | 14202a52746b |
13 | 735321c1058 |
14 | 3664c5dc147 |
15 | 1b09313e73b |
hex | e91638efd3 |
1001100210131 has 8 divisors (see below), whose sum is σ = 1155909521760. Its totient is φ = 849239647488.
The previous prime is 1001100210119. The next prime is 1001100210133. The reversal of 1001100210131 is 1310120011001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1001100210131 - 210 = 1001100209107 is a prime.
It is a super-2 number, since 2×10011002101312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1001100210133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 737186516 + ... + 737187873.
It is an arithmetic number, because the mean of its divisors is an integer number (144488690220).
Almost surely, 21001100210131 is an apocalyptic number.
1001100210131 is a deficient number, since it is larger than the sum of its proper divisors (154809311629).
1001100210131 is an equidigital number, since it uses as much as digits as its factorization.
1001100210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1474374493.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1001100210131 its reverse (1310120011001), we get a palindrome (2311220221132).
The spelling of 1001100210131 in words is "one trillion, one billion, one hundred million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •