Base | Representation |
---|---|
bin | 110000010001101010100001… |
… | …111100001001100111111100 |
3 | 1000211202121100221011211022102 |
4 | 300101222201330021213330 |
5 | 210312123111313212200 |
6 | 2031322304333004232 |
7 | 62502423520244360 |
oct | 6021524174114774 |
9 | 1024677327154272 |
10 | 212320130210300 |
11 | 61719509369392 |
12 | 1b991092023678 |
13 | 91619191453b8 |
14 | 3a604c60432a0 |
15 | 1982e01a5a6d5 |
hex | c11aa1f099fc |
212320130210300 has 144 divisors (see below), whose sum is σ = 539400030855168. Its totient is φ = 71038306886400.
The previous prime is 212320130210281. The next prime is 212320130210317. The reversal of 212320130210300 is 3012031023212.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14153354 + ... + 24999153.
Almost surely, 2212320130210300 is an apocalyptic number.
212320130210300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212320130210300 is an abundant number, since it is smaller than the sum of its proper divisors (327079900644868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212320130210300 is a wasteful number, since it uses less digits than its factorization.
212320130210300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39152716 (or 39152709 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 212320130210300 its reverse (3012031023212), we get a palindrome (215332161233512).
The spelling of 212320130210300 in words is "two hundred twelve trillion, three hundred twenty billion, one hundred thirty million, two hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •