Base | Representation |
---|---|
bin | 1001010010011111100001… |
… | …0100001101111010000001 |
3 | 1100011101022200001012122002 |
4 | 2110213320110031322001 |
5 | 2314313321121441001 |
6 | 33415532103153345 |
7 | 2102613114521426 |
oct | 224477024157201 |
9 | 40141280035562 |
10 | 10213303312001 |
11 | 328848a506449 |
12 | 118b4a6745855 |
13 | 59115863683a |
14 | 27447dd71d4d |
15 | 12aa1127e46b |
hex | 949f850de81 |
10213303312001 has 8 divisors (see below), whose sum is σ = 10767110121600. Its totient is φ = 9661122955440.
The previous prime is 10213303311977. The next prime is 10213303312019. The reversal of 10213303312001 is 10021330331201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213303312001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10213303317001) 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, 406600361 + ... + 406625478.
It is an arithmetic number, because the mean of its divisors is an integer number (1345888765200).
Almost surely, 210213303312001 is an apocalyptic number.
It is an amenable number.
10213303312001 is a deficient number, since it is larger than the sum of its proper divisors (553806809599).
10213303312001 is an equidigital number, since it uses as much as digits as its factorization.
10213303312001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 813226519.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10213303312001 its reverse (10021330331201), we get a palindrome (20234633643202).
It can be divided in two parts, 1021330331200 and 1, that added together give a palindrome (1021330331201).
The spelling of 10213303312001 in words is "ten trillion, two hundred thirteen billion, three hundred three million, three hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •