Base | Representation |
---|---|
bin | 10010110111101000… |
… | …00101010010111111 |
3 | 222010222222021220210 |
4 | 21123310011102333 |
5 | 131221330030211 |
6 | 4353115443503 |
7 | 506016152256 |
oct | 113364052277 |
9 | 28128867823 |
10 | 10130314431 |
11 | 4329331196 |
12 | 1b68756593 |
13 | c559b60c3 |
14 | 6c15a579d |
15 | 3e454e9a6 |
hex | 25bd054bf |
10130314431 has 8 divisors (see below), whose sum is σ = 13510684720. Its totient is φ = 6751743552.
The previous prime is 10130314427. The next prime is 10130314457. The reversal of 10130314431 is 13441303101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10130314431 - 22 = 10130314427 is a prime.
It is a super-2 number, since 2×101303144312 (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 = 10130314398 and 10130314407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130314031) 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 7 ways as a sum of consecutive naturals, for example, 436660 + ... + 459273.
It is an arithmetic number, because the mean of its divisors is an integer number (1688835590).
Almost surely, 210130314431 is an apocalyptic number.
10130314431 is a deficient number, since it is larger than the sum of its proper divisors (3380370289).
10130314431 is an equidigital number, since it uses as much as digits as its factorization.
10130314431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899705.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10130314431 its reverse (13441303101), we get a palindrome (23571617532).
The spelling of 10130314431 in words is "ten billion, one hundred thirty million, three hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •