Base | Representation |
---|---|
bin | 1001010001110101011011… |
… | …0001110111010100011101 |
3 | 1100010022011010222002022001 |
4 | 2110131112301313110131 |
5 | 2314122200312141341 |
6 | 33410422515322301 |
7 | 2102033102506642 |
oct | 224352661672435 |
9 | 40108133862261 |
10 | 10202003240221 |
11 | 3283710955251 |
12 | 11892722b0391 |
13 | 5900774b7830 |
14 | 273acb2addc9 |
15 | 12a59e1b9d31 |
hex | 94756c7751d |
10202003240221 has 16 divisors (see below), whose sum is σ = 11565140408640. Its totient is φ = 8921500012800.
The previous prime is 10202003240173. The next prime is 10202003240267. The reversal of 10202003240221 is 12204230020201.
It is a cyclic number.
It is not a de Polignac number, because 10202003240221 - 211 = 10202003238173 is a prime.
It is a super-2 number, since 2×102020032402212 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202003247221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40293621 + ... + 40546021.
It is an arithmetic number, because the mean of its divisors is an integer number (722821275540).
Almost surely, 210202003240221 is an apocalyptic number.
It is an amenable number.
10202003240221 is a deficient number, since it is larger than the sum of its proper divisors (1363137168419).
10202003240221 is a wasteful number, since it uses less digits than its factorization.
10202003240221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416076.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 10202003240221 its reverse (12204230020201), we get a palindrome (22406233260422).
The spelling of 10202003240221 in words is "ten trillion, two hundred two billion, three million, two hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •