Base | Representation |
---|---|
bin | 1001010010010111110011… |
… | …0110110101111011010001 |
3 | 1100011011222022112100222112 |
4 | 2110211330312311323101 |
5 | 2314300100343422113 |
6 | 33414550352115105 |
7 | 2102510564006021 |
oct | 224457466657321 |
9 | 40134868470875 |
10 | 10211232014033 |
11 | 32876172a1646 |
12 | 118b008b35a95 |
13 | 590bb8487c3b |
14 | 274324c37a81 |
15 | 12a93e4d65a8 |
hex | 9497cdb5ed1 |
10211232014033 has 8 divisors (see below), whose sum is σ = 10217637818880. Its totient is φ = 10204826854320.
The previous prime is 10211232014003. The next prime is 10211232014063. The reversal of 10211232014033 is 33041023211201.
It is an interprime number because it is at equal distance from previous prime (10211232014003) and next prime (10211232014063).
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-10211232014033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211232014003) 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, 33725363 + ... + 34026791.
It is an arithmetic number, because the mean of its divisors is an integer number (1277204727360).
Almost surely, 210211232014033 is an apocalyptic number.
It is an amenable number.
10211232014033 is a deficient number, since it is larger than the sum of its proper divisors (6405804847).
10211232014033 is a wasteful number, since it uses less digits than its factorization.
10211232014033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322567.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10211232014033 its reverse (33041023211201), we get a palindrome (43252255225234).
The spelling of 10211232014033 in words is "ten trillion, two hundred eleven billion, two hundred thirty-two million, fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •