Base | Representation |
---|---|
bin | 10010110111101101… |
… | …01101001101010111 |
3 | 222011001021020100200 |
4 | 21123312231031113 |
5 | 131222014032244 |
6 | 4353142311543 |
7 | 506025045363 |
oct | 113366551527 |
9 | 28131236320 |
10 | 10131002199 |
11 | 432976099a |
12 | 1b68a285b3 |
13 | c55b97176 |
14 | 6c17042a3 |
15 | 3e4638669 |
hex | 25bdad357 |
10131002199 has 6 divisors (see below), whose sum is σ = 14633669856. Its totient is φ = 6754001460.
The previous prime is 10131002131. The next prime is 10131002209. The reversal of 10131002199 is 99120013101.
It is not a de Polignac number, because 10131002199 - 211 = 10131000151 is a prime.
It is a super-2 number, since 2×101310021992 (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 (10131002599) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 562833447 + ... + 562833464.
It is an arithmetic number, because the mean of its divisors is an integer number (2438944976).
Almost surely, 210131002199 is an apocalyptic number.
10131002199 is a deficient number, since it is larger than the sum of its proper divisors (4502667657).
10131002199 is a wasteful number, since it uses less digits than its factorization.
10131002199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125666917 (or 1125666914 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
The spelling of 10131002199 in words is "ten billion, one hundred thirty-one million, two thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •