Base | Representation |
---|---|
bin | 1001010010011100010011… |
… | …0111100101000000100001 |
3 | 1100011022002111212212111201 |
4 | 2110213010313211000201 |
5 | 2314310034140311213 |
6 | 33415310311041201 |
7 | 2102552534100151 |
oct | 224470467450041 |
9 | 40138074785451 |
10 | 10212440166433 |
11 | 32880872663aa |
12 | 118b2a5670201 |
13 | 59104b87500b |
14 | 2743db48a761 |
15 | 12a9b05d26dd |
hex | 949c4de5021 |
10212440166433 has 8 divisors (see below), whose sum is σ = 10679475426048. Its totient is φ = 9747322917024.
The previous prime is 10212440166421. The next prime is 10212440166469. The reversal of 10212440166433 is 33466104421201.
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 10212440166433 - 213 = 10212440158241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10212440166392 and 10212440166401.
It is not an unprimeable number, because it can be changed into a prime (10212440161433) 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, 479491660 + ... + 479512957.
It is an arithmetic number, because the mean of its divisors is an integer number (1334934428256).
Almost surely, 210212440166433 is an apocalyptic number.
It is an amenable number.
10212440166433 is a deficient number, since it is larger than the sum of its proper divisors (467035259615).
10212440166433 is an equidigital number, since it uses as much as digits as its factorization.
10212440166433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 959005103.
The product of its (nonzero) digits is 82944, while the sum is 37.
Adding to 10212440166433 its reverse (33466104421201), we get a palindrome (43678544587634).
The spelling of 10212440166433 in words is "ten trillion, two hundred twelve billion, four hundred forty million, one hundred sixty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •