Base | Representation |
---|---|
bin | 110011010100100101… |
… | …0100011110011101010 |
3 | 101112110212212221020102 |
4 | 1212221022203303222 |
5 | 3301203322100020 |
6 | 122344132025402 |
7 | 10651110043631 |
oct | 1465112436352 |
9 | 345425787212 |
10 | 110212300010 |
11 | 42816a7426a |
12 | 19439a62262 |
13 | a51549c907 |
14 | 5497488518 |
15 | 2d00a81475 |
hex | 19a92a3cea |
110212300010 has 8 divisors (see below), whose sum is σ = 198382140036. Its totient is φ = 44084920000.
The previous prime is 110212299971. The next prime is 110212300019. The reversal of 110212300010 is 10003212011.
It can be written as a sum of positive squares in 2 ways, for example, as 109741800529 + 470499481 = 331273^2 + 21691^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110212299964 and 110212300000.
It is not an unprimeable number, because it can be changed into a prime (110212300019) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 5510614991 + ... + 5510615010.
Almost surely, 2110212300010 is an apocalyptic number.
110212300010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110212300010 is a deficient number, since it is larger than the sum of its proper divisors (88169840026).
110212300010 is a wasteful number, since it uses less digits than its factorization.
110212300010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11021230008.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 110212300010 its reverse (10003212011), we get a palindrome (120215512021).
The spelling of 110212300010 in words is "one hundred ten billion, two hundred twelve million, three hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •