Base | Representation |
---|---|
bin | 1001010011000111110010… |
… | …1011110000111101111111 |
3 | 1100012102020002021200010111 |
4 | 2110301330223300331333 |
5 | 2320002441141341111 |
6 | 33424520530050451 |
7 | 2103445035123343 |
oct | 224617453607577 |
9 | 40172202250114 |
10 | 10224114012031 |
11 | 32920278aa387 |
12 | 1191603119a27 |
13 | 59218c28226a |
14 | 274bc7a47623 |
15 | 12ae453c9a21 |
hex | 94c7caf0f7f |
10224114012031 has 16 divisors (see below), whose sum is σ = 10345697316864. Its totient is φ = 10103374980864.
The previous prime is 10224114011977. The next prime is 10224114012041. The reversal of 10224114012031 is 13021041142201.
It is a cyclic number.
It is not a de Polignac number, because 10224114012031 - 211 = 10224114009983 is a prime.
It is a super-2 number, since 2×102241140120312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10224114011993 and 10224114012011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10224114012041) 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, 26885391 + ... + 27263023.
It is an arithmetic number, because the mean of its divisors is an integer number (646606082304).
Almost surely, 210224114012031 is an apocalyptic number.
10224114012031 is a deficient number, since it is larger than the sum of its proper divisors (121583304833).
10224114012031 is a wasteful number, since it uses less digits than its factorization.
10224114012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378750.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 10224114012031 its reverse (13021041142201), we get a palindrome (23245155154232).
The spelling of 10224114012031 in words is "ten trillion, two hundred twenty-four billion, one hundred fourteen million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •