Base | Representation |
---|---|
bin | 11101001001101000000… |
… | …110101011010000000100 |
3 | 21002111121112201210102210 |
4 | 131021220012223100010 |
5 | 230310024020343140 |
6 | 4132131420503420 |
7 | 264504124310040 |
oct | 35115006532004 |
9 | 7074545653383 |
10 | 2003201340420 |
11 | 702609a2a275 |
12 | 2842980aab70 |
13 | 116b93882047 |
14 | 6cd53b07020 |
15 | 37194092d80 |
hex | 1d2681ab404 |
2003201340420 has 48 divisors (see below), whose sum is σ = 6410244290688. Its totient is φ = 457874592000.
The previous prime is 2003201340391. The next prime is 2003201340463. The reversal of 2003201340420 is 240431023002.
It is a super-2 number, since 2×20032013404202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2384763081 + ... + 2384763920.
It is an arithmetic number, because the mean of its divisors is an integer number (133546756056).
Almost surely, 22003201340420 is an apocalyptic number.
2003201340420 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2003201340420 is an abundant number, since it is smaller than the sum of its proper divisors (4407042950268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003201340420 is a wasteful number, since it uses less digits than its factorization.
2003201340420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4769527020 (or 4769527018 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 2003201340420 its reverse (240431023002), we get a palindrome (2243632363422).
The spelling of 2003201340420 in words is "two trillion, three billion, two hundred one million, three hundred forty thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •