Base | Representation |
---|---|
bin | 1100010101110011111… |
… | …0100011110100001000 |
3 | 202021020120102121101111 |
4 | 3011130332203310020 |
5 | 11433200401113000 |
6 | 241221512500104 |
7 | 21213613216114 |
oct | 3053476436410 |
9 | 667216377344 |
10 | 212013301000 |
11 | 81a06a88036 |
12 | 3510a9aa634 |
13 | 16cba15cbc7 |
14 | a3937a2744 |
15 | 57ace70cba |
hex | 315cfa3d08 |
212013301000 has 32 divisors (see below), whose sum is σ = 496111126680. Its totient is φ = 84805320000.
The previous prime is 212013300979. The next prime is 212013301013. The reversal of 212013301000 is 103310212.
212013301000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 10740835044 + 201272465956 = 103638^2 + 448634^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106005651 + ... + 106007650.
Almost surely, 2212013301000 is an apocalyptic number.
212013301000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212013301000 is an abundant number, since it is smaller than the sum of its proper divisors (284097825680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212013301000 is a wasteful number, since it uses less digits than its factorization.
212013301000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212013322 (or 212013308 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 212013301000 its reverse (103310212), we get a palindrome (212116611212).
The spelling of 212013301000 in words is "two hundred twelve billion, thirteen million, three hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •