Base | Representation |
---|---|
bin | 10111100101000111011… |
… | …100011010100010001000 |
3 | 12201220112112220222120201 |
4 | 113211013130122202020 |
5 | 203022040213123030 |
6 | 3240222503301544 |
7 | 225033024543412 |
oct | 27450734324210 |
9 | 5656475828521 |
10 | 1620401301640 |
11 | 575232322360 |
12 | 22206514a8b4 |
13 | b9a597a9864 |
14 | 585dbdd59b2 |
15 | 2c23c6be2ca |
hex | 1794771a888 |
1620401301640 has 64 divisors (see below), whose sum is σ = 4001749738560. Its totient is φ = 585621861120.
The previous prime is 1620401301611. The next prime is 1620401301641. The reversal of 1620401301640 is 461031040261.
It is a junction number, because it is equal to n+sod(n) for n = 1620401301599 and 1620401301608.
It is not an unprimeable number, because it can be changed into a prime (1620401301641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11224999 + ... + 11368438.
It is an arithmetic number, because the mean of its divisors is an integer number (62527339665).
Almost surely, 21620401301640 is an apocalyptic number.
1620401301640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1620401301640 is an abundant number, since it is smaller than the sum of its proper divisors (2381348436920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1620401301640 is a wasteful number, since it uses less digits than its factorization.
1620401301640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22593622 (or 22593618 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 1620401301640 in words is "one trillion, six hundred twenty billion, four hundred one million, three hundred one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •