Base | Representation |
---|---|
bin | 10011000010010101… |
… | …01010100001000011 |
3 | 222101020221220011211 |
4 | 21201022222201003 |
5 | 131412322321011 |
6 | 4410044350551 |
7 | 511156405414 |
oct | 114112524103 |
9 | 28336856154 |
10 | 10220120131 |
11 | 4374a9a581 |
12 | 1b92845457 |
13 | c6b49a780 |
14 | 6cd4a180b |
15 | 3ec38db21 |
hex | 2612aa843 |
10220120131 has 8 divisors (see below), whose sum is σ = 11303750864. Its totient is φ = 9178984800.
The previous prime is 10220120107. The next prime is 10220120153. The reversal of 10220120131 is 13102102201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10220120131 - 219 = 10219595843 is a prime.
It is a super-2 number, since 2×102201201312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220120161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10623345 + ... + 10624306.
It is an arithmetic number, because the mean of its divisors is an integer number (1412968858).
Almost surely, 210220120131 is an apocalyptic number.
10220120131 is a deficient number, since it is larger than the sum of its proper divisors (1083630733).
10220120131 is a wasteful number, since it uses less digits than its factorization.
10220120131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21247701.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10220120131 its reverse (13102102201), we get a palindrome (23322222332).
The spelling of 10220120131 in words is "ten billion, two hundred twenty million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •