Base | Representation |
---|---|
bin | 101111111000000100010001… |
… | …0011111010111010100000100 |
3 | 2001020001212210202021110010002 |
4 | 1133300020202133113110010 |
5 | 420144131101214120400 |
6 | 4051352455422220432 |
7 | 154463032522524224 |
oct | 13760104237272404 |
9 | 2036055722243102 |
10 | 421122122020100 |
11 | 112200986281866 |
12 | 3b294356724718 |
13 | 150c9851812277 |
14 | 75dc5c2dd4084 |
15 | 33a4545b47ed5 |
hex | 17f02227d7504 |
421122122020100 has 72 divisors (see below), whose sum is σ = 916167644330400. Its totient is φ = 168019112826880.
The previous prime is 421122122020099. The next prime is 421122122020147. The reversal of 421122122020100 is 1020221221124.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 23 ways as a sum of consecutive naturals, for example, 136905599 + ... + 139947801.
It is an arithmetic number, because the mean of its divisors is an integer number (12724550615700).
Almost surely, 2421122122020100 is an apocalyptic number.
It is an amenable number.
421122122020100 is an abundant number, since it is smaller than the sum of its proper divisors (495045522310300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421122122020100 is a wasteful number, since it uses less digits than its factorization.
421122122020100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3045749 (or 3045742 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 421122122020100 its reverse (1020221221124), we get a palindrome (422142343241224).
The spelling of 421122122020100 in words is "four hundred twenty-one trillion, one hundred twenty-two billion, one hundred twenty-two million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •