Base | Representation |
---|---|
bin | 1001000111111001101010… |
… | …0001111000111001000001 |
3 | 1022111222122102020202002102 |
4 | 2101332122201320321001 |
5 | 2303323141322224301 |
6 | 33200200132000145 |
7 | 2053511662265012 |
oct | 221763241707101 |
9 | 38458572222072 |
10 | 10031341211201 |
11 | 32182a4662962 |
12 | 1160183a60055 |
13 | 579c4a3574cb |
14 | 26973b745009 |
15 | 125e1169cb6b |
hex | 91f9a878e41 |
10031341211201 has 8 divisors (see below), whose sum is σ = 10073990424960. Its totient is φ = 9988697640208.
The previous prime is 10031341211149. The next prime is 10031341211231. The reversal of 10031341211201 is 10211214313001.
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 10031341211201 - 238 = 9756463304257 is a prime.
It is a super-3 number, since 3×100313412112013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10031341211231) 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, 2171630 + ... + 4977816.
It is an arithmetic number, because the mean of its divisors is an integer number (1259248803120).
Almost surely, 210031341211201 is an apocalyptic number.
It is an amenable number.
10031341211201 is a deficient number, since it is larger than the sum of its proper divisors (42649213759).
10031341211201 is a wasteful number, since it uses less digits than its factorization.
10031341211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2821383.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10031341211201 its reverse (10211214313001), we get a palindrome (20242555524202).
The spelling of 10031341211201 in words is "ten trillion, thirty-one billion, three hundred forty-one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •