Base | Representation |
---|---|
bin | 10010110111101000… |
… | …00111011001001111 |
3 | 222010222222201201000 |
4 | 21123310013121033 |
5 | 131221330314043 |
6 | 4353115551343 |
7 | 506016216312 |
oct | 113364073117 |
9 | 28128881630 |
10 | 10130323023 |
11 | 4329337697 |
12 | 1b6875b553 |
13 | c559b9ca2 |
14 | 6c15a8979 |
15 | 3e45522d3 |
hex | 25bd0764f |
10130323023 has 32 divisors (see below), whose sum is σ = 15291622400. Its totient is φ = 6626924928.
The previous prime is 10130323013. The next prime is 10130323033. The reversal of 10130323023 is 32032303101.
It is an interprime number because it is at equal distance from previous prime (10130323013) and next prime (10130323033).
It is not a de Polignac number, because 10130323023 - 214 = 10130306639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10130322987 and 10130323005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130323013) 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 31 ways as a sum of consecutive naturals, for example, 333111 + ... + 362247.
It is an arithmetic number, because the mean of its divisors is an integer number (477863200).
Almost surely, 210130323023 is an apocalyptic number.
10130323023 is a deficient number, since it is larger than the sum of its proper divisors (5161299377).
10130323023 is a wasteful number, since it uses less digits than its factorization.
10130323023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29388 (or 29382 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 10130323023 its reverse (32032303101), we get a palindrome (42162626124).
The spelling of 10130323023 in words is "ten billion, one hundred thirty million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •