Base | Representation |
---|---|
bin | 1001010001110101011011… |
… | …0010010000001011010001 |
3 | 1100010022011011011020221212 |
4 | 2110131112302100023101 |
5 | 2314122200323421113 |
6 | 33410422521425505 |
7 | 2102033103412526 |
oct | 224352662201321 |
9 | 40108134136855 |
10 | 10202003342033 |
11 | 3283710a14798 |
12 | 118927233b295 |
13 | 590077521c89 |
14 | 273acb2d914d |
15 | 12a59e1da0a8 |
hex | 94756c902d1 |
10202003342033 has 8 divisors (see below), whose sum is σ = 10858676797440. Its totient is φ = 9551613843520.
The previous prime is 10202003342021. The next prime is 10202003342071. The reversal of 10202003342033 is 33024330020201.
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 10202003342033 - 222 = 10201999147729 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10202003342933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1570985873 + ... + 1570992366.
It is an arithmetic number, because the mean of its divisors is an integer number (1357334599680).
Almost surely, 210202003342033 is an apocalyptic number.
It is an amenable number.
10202003342033 is a deficient number, since it is larger than the sum of its proper divisors (656673455407).
10202003342033 is a wasteful number, since it uses less digits than its factorization.
10202003342033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3141978447.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 10202003342033 its reverse (33024330020201), we get a palindrome (43226333362234).
The spelling of 10202003342033 in words is "ten trillion, two hundred two billion, three million, three hundred forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •