Base | Representation |
---|---|
bin | 1001011000000111110100… |
… | …0101111010001001100101 |
3 | 1100111121222000221202101120 |
4 | 2112001331011322021211 |
5 | 2322404410133230201 |
6 | 33532205150044153 |
7 | 2112605624560656 |
oct | 226017505721145 |
9 | 40447860852346 |
10 | 10310020211301 |
11 | 331550069a388 |
12 | 11a6198aa9659 |
13 | 59a2ccbccc35 |
14 | 279016d7552d |
15 | 12d2c2153536 |
hex | 9607d17a265 |
10310020211301 has 8 divisors (see below), whose sum is σ = 13748457625920. Its totient is φ = 6872464802112.
The previous prime is 10310020211201. The next prime is 10310020211311. The reversal of 10310020211301 is 10311202001301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10310020211301 - 210 = 10310020210277 is a prime.
It is a super-2 number, since 2×103100202113012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310020211311) 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, 220474081 + ... + 220520838.
It is an arithmetic number, because the mean of its divisors is an integer number (1718557203240).
Almost surely, 210310020211301 is an apocalyptic number.
It is an amenable number.
10310020211301 is a deficient number, since it is larger than the sum of its proper divisors (3438437414619).
10310020211301 is an equidigital number, since it uses as much as digits as its factorization.
10310020211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441002715.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10310020211301 its reverse (10311202001301), we get a palindrome (20621222212602).
The spelling of 10310020211301 in words is "ten trillion, three hundred ten billion, twenty million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •