Base | Representation |
---|---|
bin | 11101001001000100010… |
… | …01001011000111010011 |
3 | 10112201112022222221110211 |
4 | 32210202021023013103 |
5 | 112401130323211011 |
6 | 2043554014304551 |
7 | 132225103233064 |
oct | 16444211130723 |
9 | 3481468887424 |
10 | 1001300210131 |
11 | 356715957021 |
12 | 1420854b8157 |
13 | 73564778350 |
14 | 3666adc056b |
15 | 1b0a5998b21 |
hex | e92224b1d3 |
1001300210131 has 8 divisors (see below), whose sum is σ = 1093510956384. Its totient is φ = 911259128640.
The previous prime is 1001300210129. The next prime is 1001300210153. The reversal of 1001300210131 is 1310120031001.
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 1001300210131 - 21 = 1001300210129 is a prime.
It is a super-2 number, since 2×10013002101312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001300210111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 542415226 + ... + 542417071.
It is an arithmetic number, because the mean of its divisors is an integer number (136688869548).
Almost surely, 21001300210131 is an apocalyptic number.
1001300210131 is a deficient number, since it is larger than the sum of its proper divisors (92210746253).
1001300210131 is a wasteful number, since it uses less digits than its factorization.
1001300210131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1084832381.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1001300210131 its reverse (1310120031001), we get a palindrome (2311420241132).
The spelling of 1001300210131 in words is "one trillion, one billion, three hundred million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •