Base | Representation |
---|---|
bin | 1001001100011110110001… |
… | …0001101101001111011111 |
3 | 1022210111201211020122110200 |
4 | 2103013230101231033133 |
5 | 2311120311130042343 |
6 | 33300251404434543 |
7 | 2062265526022005 |
oct | 223075421551737 |
9 | 38714654218420 |
10 | 10110022112223 |
11 | 32486aaa073a0 |
12 | 1173481b48a53 |
13 | 5844a90c8087 |
14 | 26d48322aa75 |
15 | 127eb8e574d3 |
hex | 931ec46d3df |
10110022112223 has 24 divisors (see below), whose sum is σ = 15931309816656. Its totient is φ = 6127145404800.
The previous prime is 10110022112219. The next prime is 10110022112231. The reversal of 10110022112223 is 32221122001101.
It is not a de Polignac number, because 10110022112223 - 22 = 10110022112219 is a prime.
It is a super-3 number, since 3×101100221122233 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110022112196 and 10110022112205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110022112213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3243211 + ... + 5544227.
It is an arithmetic number, because the mean of its divisors is an integer number (663804575694).
Almost surely, 210110022112223 is an apocalyptic number.
10110022112223 is a deficient number, since it is larger than the sum of its proper divisors (5821287704433).
10110022112223 is a wasteful number, since it uses less digits than its factorization.
10110022112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2345415 (or 2345412 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10110022112223 its reverse (32221122001101), we get a palindrome (42331144113324).
The spelling of 10110022112223 in words is "ten trillion, one hundred ten billion, twenty-two million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •