Base | Representation |
---|---|
bin | 10001101001101100100… |
… | …011011111010010110100 |
3 | 11021221222012022011101111 |
4 | 101221230203133102310 |
5 | 124333212004120040 |
6 | 2325125003004404 |
7 | 153431215022650 |
oct | 21515443372264 |
9 | 4257865264344 |
10 | 1213002020020 |
11 | 42848202118a |
12 | 177107b09704 |
13 | 8a502215c8b |
14 | 429d125ba60 |
15 | 218463dadea |
hex | 11a6c8df4b4 |
1213002020020 has 384 divisors, whose sum is σ = 3218890752000. Its totient is φ = 374643118080.
The previous prime is 1213002019981. The next prime is 1213002020047. The reversal of 1213002020020 is 200202003121.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1445770761 + ... + 1445771599.
It is an arithmetic number, because the mean of its divisors is an integer number (8382528000).
Almost surely, 21213002020020 is an apocalyptic number.
1213002020020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1213002020020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1609445376000).
1213002020020 is an abundant number, since it is smaller than the sum of its proper divisors (2005888731980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1213002020020 is a wasteful number, since it uses less digits than its factorization.
1213002020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191 (or 1189 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 1213002020020 its reverse (200202003121), we get a palindrome (1413204023141).
The spelling of 1213002020020 in words is "one trillion, two hundred thirteen billion, two million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •