Base | Representation |
---|---|
bin | 10110010111101110… |
… | …10100011100100110 |
3 | 1011000000022221100201 |
4 | 23023313110130212 |
5 | 144044103223420 |
6 | 5303432301114 |
7 | 603424052512 |
oct | 131367243446 |
9 | 34000287321 |
10 | 12010211110 |
11 | 51034a6407 |
12 | 23b224179a |
13 | 11952cb4c1 |
14 | 81d119142 |
15 | 4a45db10a |
hex | 2cbdd4726 |
12010211110 has 8 divisors (see below), whose sum is σ = 21618380016. Its totient is φ = 4804084440.
The previous prime is 12010211099. The next prime is 12010211117. The reversal of 12010211110 is 1111201021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1201021111 = 12010211110 / (1 + 2 + 0 + 1 + 0 + 2 + 1 + 1 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010211117) 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, 600510546 + ... + 600510565.
It is an arithmetic number, because the mean of its divisors is an integer number (2702297502).
Almost surely, 212010211110 is an apocalyptic number.
12010211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12010211110 is a deficient number, since it is larger than the sum of its proper divisors (9608168906).
12010211110 is a wasteful number, since it uses less digits than its factorization.
12010211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201021118.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12010211110 its reverse (1111201021), we get a palindrome (13121412131).
The spelling of 12010211110 in words is "twelve billion, ten million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •