Base | Representation |
---|---|
bin | 10010110110011001… |
… | …10100100011010111 |
3 | 222010021121101200012 |
4 | 21123030310203113 |
5 | 131211211202411 |
6 | 4352111110435 |
7 | 505532524664 |
oct | 113314644327 |
9 | 28107541605 |
10 | 10120022231 |
11 | 4323541540 |
12 | 1b6521241b |
13 | c53821547 |
14 | 6c0086a6b |
15 | 3e36ba18b |
hex | 25b3348d7 |
10120022231 has 16 divisors (see below), whose sum is σ = 11625123840. Its totient is φ = 8712774720.
The previous prime is 10120022221. The next prime is 10120022309. The reversal of 10120022231 is 13222002101.
It is a happy number.
10120022231 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10120022231 - 26 = 10120022167 is a prime.
It is a super-2 number, since 2×101200222312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120022201) 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, 761066 + ... + 774248.
It is an arithmetic number, because the mean of its divisors is an integer number (726570240).
Almost surely, 210120022231 is an apocalyptic number.
10120022231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10120022231 is a deficient number, since it is larger than the sum of its proper divisors (1505101609).
10120022231 is a wasteful number, since it uses less digits than its factorization.
10120022231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16886.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10120022231 its reverse (13222002101), we get a palindrome (23342024332).
The spelling of 10120022231 in words is "ten billion, one hundred twenty million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •