Base | Representation |
---|---|
bin | 11001000011110011001000… |
… | …001110011000110101111011 |
3 | 112110020012000002222022211110 |
4 | 121003303020032120311323 |
5 | 103421204111311432311 |
6 | 1030222443411331403 |
7 | 32133366361151256 |
oct | 3103631016306573 |
9 | 473205002868743 |
10 | 110212220030331 |
11 | 32131815a87011 |
12 | 1043ba495b0b63 |
13 | 4965c772035c3 |
14 | 1d3042ad5809d |
15 | cb1d158bb8a6 |
hex | 643cc8398d7b |
110212220030331 has 16 divisors (see below), whose sum is σ = 149402616168960. Its totient is φ = 72255729468000.
The previous prime is 110212220030317. The next prime is 110212220030369. The reversal of 110212220030331 is 133030022212011.
It is not a de Polignac number, because 110212220030331 - 25 = 110212220030299 is a prime.
It is a super-2 number, since 2×1102122200303312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110212220030298 and 110212220030307.
It is not an unprimeable number, because it can be changed into a prime (110262220030331) 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, 926296020 + ... + 926414993.
It is an arithmetic number, because the mean of its divisors is an integer number (9337663510560).
Almost surely, 2110212220030331 is an apocalyptic number.
110212220030331 is a deficient number, since it is larger than the sum of its proper divisors (39190396138629).
110212220030331 is a wasteful number, since it uses less digits than its factorization.
110212220030331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1852711346.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110212220030331 its reverse (133030022212011), we get a palindrome (243242242242342).
The spelling of 110212220030331 in words is "one hundred ten trillion, two hundred twelve billion, two hundred twenty million, thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •