Base | Representation |
---|---|
bin | 110000010000000100010101… |
… | …100101101001110001011000 |
3 | 1000211101010010201220122120020 |
4 | 300100010111211221301120 |
5 | 210303323400214220044 |
6 | 2031200040150030440 |
7 | 62461460400126312 |
oct | 6020042545516130 |
9 | 1024333121818506 |
10 | 212210401320024 |
11 | 61686a2025aaa8 |
12 | 1b97396a048420 |
13 | 915447cb6c463 |
14 | 3a59076c727b2 |
15 | 198012d666a19 |
hex | c10115969c58 |
212210401320024 has 32 divisors (see below), whose sum is σ = 530536338150000. Its totient is φ = 70735422460032.
The previous prime is 212210401319927. The next prime is 212210401320101. The reversal of 212210401320024 is 420023104012212.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 212210401319976 and 212210401320003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84865699 + ... + 87330450.
Almost surely, 2212210401320024 is an apocalyptic number.
212210401320024 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
212210401320024 is an abundant number, since it is smaller than the sum of its proper divisors (318325936829976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212210401320024 is a wasteful number, since it uses less digits than its factorization.
212210401320024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172247507 (or 172247503 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 212210401320024 its reverse (420023104012212), we get a palindrome (632233505332236).
The spelling of 212210401320024 in words is "two hundred twelve trillion, two hundred ten billion, four hundred one million, three hundred twenty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •