Base | Representation |
---|---|
bin | 1001010010010111011111… |
… | …11111110010101010100000 |
3 | 2200022100112021022011210102 |
4 | 10221023233333302222200 |
5 | 10134044333024034100 |
6 | 111233513042121532 |
7 | 4205314441224413 |
oct | 451135777625240 |
9 | 80270467264712 |
10 | 20422301002400 |
11 | 656405a564630 |
12 | 2359b8b3502a8 |
13 | b51a78c3318b |
14 | 508632155b7a |
15 | 25636e518cd5 |
hex | 1292efff2aa0 |
20422301002400 has 72 divisors (see below), whose sum is σ = 54388300738464. Its totient is φ = 7426291270400.
The previous prime is 20422301002381. The next prime is 20422301002403. The reversal of 20422301002400 is 420010322402.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (20422301002403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1160349212 + ... + 1160366811.
It is an arithmetic number, because the mean of its divisors is an integer number (755393065812).
Almost surely, 220422301002400 is an apocalyptic number.
20422301002400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20422301002400 is an abundant number, since it is smaller than the sum of its proper divisors (33965999736064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20422301002400 is a wasteful number, since it uses less digits than its factorization.
20422301002400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2320716054 (or 2320716041 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 20422301002400 its reverse (420010322402), we get a palindrome (20842311324802).
The spelling of 20422301002400 in words is "twenty trillion, four hundred twenty-two billion, three hundred one million, two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.911 sec. • engine limits •