Base | Representation |
---|---|
bin | 10010110111100101… |
… | …11001010001001111 |
3 | 222010222101110202011 |
4 | 21123302321101033 |
5 | 131221240044043 |
6 | 4353105042051 |
7 | 506013414340 |
oct | 113362712117 |
9 | 28128343664 |
10 | 10130003023 |
11 | 4329139228 |
12 | 1b68626327 |
13 | c5590743a |
14 | 6c15240c7 |
15 | 3e44dc59d |
hex | 25bcb944f |
10130003023 has 8 divisors (see below), whose sum is σ = 11632016000. Its totient is φ = 8641707480.
The previous prime is 10130003011. The next prime is 10130003033. The reversal of 10130003023 is 32030003101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10130003023 is a prime.
It is a super-2 number, since 2×101300030232 (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 = 10130002994 and 10130003012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130003033) 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, 3427773 + ... + 3430726.
It is an arithmetic number, because the mean of its divisors is an integer number (1454002000).
Almost surely, 210130003023 is an apocalyptic number.
10130003023 is a deficient number, since it is larger than the sum of its proper divisors (1502012977).
10130003023 is an equidigital number, since it uses as much as digits as its factorization.
10130003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6858717.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 10130003023 its reverse (32030003101), we get a palindrome (42160006124).
The spelling of 10130003023 in words is "ten billion, one hundred thirty million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •