Base | Representation |
---|---|
bin | 101111110100010001001000… |
… | …111110110101010001001100 |
3 | 1000120121111001210122110000121 |
4 | 233310101020332311101030 |
5 | 210031023401244041022 |
6 | 2023134253202234324 |
7 | 62203450060235422 |
oct | 5764211076652114 |
9 | 1016544053573017 |
10 | 210300003112012 |
11 | 6100a804279780 |
12 | 1b7056716559a4 |
13 | 9046288a95618 |
14 | 39d0808465112 |
15 | 194a5bbaa82c7 |
hex | bf4448fb544c |
210300003112012 has 48 divisors (see below), whose sum is σ = 405750139972128. Its totient is φ = 94575273246720.
The previous prime is 210300003111997. The next prime is 210300003112019. The reversal of 210300003112012 is 210211300003012.
210300003112012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (210300003112019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5535088 + ... + 21242344.
It is an arithmetic number, because the mean of its divisors is an integer number (8453127916086).
Almost surely, 2210300003112012 is an apocalyptic number.
210300003112012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210300003112012 is a deficient number, since it is larger than the sum of its proper divisors (195450136860116).
210300003112012 is a wasteful number, since it uses less digits than its factorization.
210300003112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15710506 (or 15710504 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 210300003112012 its reverse (210211300003012), we get a palindrome (420511303115024).
The spelling of 210300003112012 in words is "two hundred ten trillion, three hundred billion, three million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •