Base | Representation |
---|---|
bin | 101101111100111101001110… |
… | …010100100010111010011010 |
3 | 222111120200000012000201021010 |
4 | 231330331032110202322122 |
5 | 202442210322012401020 |
6 | 1553455530121354350 |
7 | 60366213120560643 |
oct | 5574751624427232 |
9 | 874520005021233 |
10 | 202101000122010 |
11 | 59439609896750 |
12 | 1a8006400389b6 |
13 | 88a00725b3552 |
14 | 37c9a522b46ca |
15 | 185719deadde0 |
hex | b7cf4e522e9a |
202101000122010 has 128 divisors (see below), whose sum is σ = 546321932402688. Its totient is φ = 47403669888000.
The previous prime is 202101000122009. The next prime is 202101000122033. The reversal of 202101000122010 is 10221000101202.
It is a super-3 number, since 3×2021010001220103 (a number of 44 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 46203507 + ... + 50388153.
It is an arithmetic number, because the mean of its divisors is an integer number (4268140096896).
Almost surely, 2202101000122010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 202101000122010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (273160966201344).
202101000122010 is an abundant number, since it is smaller than the sum of its proper divisors (344220932280678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202101000122010 is a wasteful number, since it uses less digits than its factorization.
202101000122010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4189420.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 202101000122010 its reverse (10221000101202), we get a palindrome (212322000223212).
The spelling of 202101000122010 in words is "two hundred two trillion, one hundred one billion, one hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •