Base | Representation |
---|---|
bin | 101111110001100010000011… |
… | …110110111010010010001011 |
3 | 1000112221111211101211020202011 |
4 | 233301202003312322102023 |
5 | 210014433400124030443 |
6 | 2022512043111320351 |
7 | 62154043352040211 |
oct | 5761420366722213 |
9 | 1015844741736664 |
10 | 210112012330123 |
11 | 60a48005395922 |
12 | 1b6951479800b7 |
13 | 90316297b7987 |
14 | 39c56932c0cb1 |
15 | 1945767ac5b9d |
hex | bf1883dba48b |
210112012330123 has 8 divisors (see below), whose sum is σ = 217357595686800. Its totient is φ = 202866451743648.
The previous prime is 210112012330081. The next prime is 210112012330151. The reversal of 210112012330123 is 321033210211012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210112012330123 - 217 = 210112012199051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210112012330094 and 210112012330103.
It is not an unprimeable number, because it can be changed into a prime (210112012330163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14266840 + ... + 24975322.
It is an arithmetic number, because the mean of its divisors is an integer number (27169699460850).
Almost surely, 2210112012330123 is an apocalyptic number.
210112012330123 is a deficient number, since it is larger than the sum of its proper divisors (7245583356677).
210112012330123 is a wasteful number, since it uses less digits than its factorization.
210112012330123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11385101.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 210112012330123 its reverse (321033210211012), we get a palindrome (531145222541135).
The spelling of 210112012330123 in words is "two hundred ten trillion, one hundred twelve billion, twelve million, three hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •