Base | Representation |
---|---|
bin | 1100010110100010111… |
… | …0011100000000010100 |
3 | 202021202022022100011121 |
4 | 3011220232130000110 |
5 | 11434101330320200 |
6 | 241253233213324 |
7 | 21221525435422 |
oct | 3055056340024 |
9 | 667668270147 |
10 | 212210401300 |
11 | 81aa826a447 |
12 | 35164a01244 |
13 | 1701bc403c1 |
14 | a3b1a2c112 |
15 | 57c0405e1a |
hex | 3168b9c014 |
212210401300 has 36 divisors (see below), whose sum is σ = 460516775040. Its totient is φ = 84880436320.
The previous prime is 212210401297. The next prime is 212210401303. The reversal of 212210401300 is 3104012212.
It is an interprime number because it is at equal distance from previous prime (212210401297) and next prime (212210401303).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212210401303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3957267 + ... + 4010533.
It is an arithmetic number, because the mean of its divisors is an integer number (12792132640).
Almost surely, 2212210401300 is an apocalyptic number.
212210401300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212210401300 is an abundant number, since it is smaller than the sum of its proper divisors (248306373740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212210401300 is a wasteful number, since it uses less digits than its factorization.
212210401300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93120 (or 93113 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 212210401300 its reverse (3104012212), we get a palindrome (215314413512).
The spelling of 212210401300 in words is "two hundred twelve billion, two hundred ten million, four hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •