Base | Representation |
---|---|
bin | 10010110110111001… |
… | …00011000111101011 |
3 | 222010120100212020012 |
4 | 21123130203013223 |
5 | 131213240121011 |
6 | 4352335322135 |
7 | 505612546052 |
oct | 113334430753 |
9 | 28116325205 |
10 | 10124145131 |
11 | 43258a80a1 |
12 | 1b6668034b |
13 | c54636029 |
14 | 6c083b399 |
15 | 3e3c31a8b |
hex | 25b7231eb |
10124145131 has 4 divisors (see below), whose sum is σ = 10134062064. Its totient is φ = 10114228200.
The previous prime is 10124145127. The next prime is 10124145151. The reversal of 10124145131 is 13154142101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10124145131 - 22 = 10124145127 is a prime.
It is a super-2 number, since 2×101241451312 (a number of 21 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 = 10124145097 and 10124145106.
It is not an unprimeable number, because it can be changed into a prime (10124145151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4956935 + ... + 4958976.
It is an arithmetic number, because the mean of its divisors is an integer number (2533515516).
Almost surely, 210124145131 is an apocalyptic number.
10124145131 is a deficient number, since it is larger than the sum of its proper divisors (9916933).
10124145131 is an equidigital number, since it uses as much as digits as its factorization.
10124145131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9916932.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 10124145131 its reverse (13154142101), we get a palindrome (23278287232).
The spelling of 10124145131 in words is "ten billion, one hundred twenty-four million, one hundred forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •