Base | Representation |
---|---|
bin | 1001000110010111101101… |
… | …11010100011110101000010 |
3 | 2121211221120021210101110000 |
4 | 10203023312322203311002 |
5 | 10110321141123223020 |
6 | 110320302500420430 |
7 | 4133452636265130 |
oct | 443136672436502 |
9 | 77757507711400 |
10 | 20010100211010 |
11 | 64152659a8068 |
12 | 22b21120a7716 |
13 | b21c37989a60 |
14 | 4d26cb828750 |
15 | 24a79693b090 |
hex | 1232f6ea3d42 |
20010100211010 has 160 divisors (see below), whose sum is σ = 66221460087552. Its totient is φ = 4221911237760.
The previous prime is 20010100210973. The next prime is 20010100211053. The reversal of 20010100211010 is 1011200101002.
It is a happy number.
It is a super-2 number, since 2×200101002110102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20010100210983 and 20010100211001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 135661606 + ... + 135809025.
Almost surely, 220010100211010 is an apocalyptic number.
20010100211010 is an abundant number, since it is smaller than the sum of its proper divisors (46211359876542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010100211010 is a wasteful number, since it uses less digits than its factorization.
20010100211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271470670 (or 271470661 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20010100211010 its reverse (1011200101002), we get a palindrome (21021300312012).
The spelling of 20010100211010 in words is "twenty trillion, ten billion, one hundred million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •