Base | Representation |
---|---|
bin | 11100111001000111… |
… | …101111000011010001 |
3 | 2222002001102202212220 |
4 | 130321013233003101 |
5 | 1002013403200423 |
6 | 22130220411253 |
7 | 2145532000005 |
oct | 347107570321 |
9 | 88061382786 |
10 | 31023100113 |
11 | 1217a805315 |
12 | 60196a6b29 |
13 | 2c0532c795 |
14 | 170428a705 |
15 | c1886e9e3 |
hex | 7391ef0d1 |
31023100113 has 8 divisors (see below), whose sum is σ = 41468326848. Its totient is φ = 20629970064.
The previous prime is 31023100103. The next prime is 31023100127. The reversal of 31023100113 is 31100132013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31023100113 - 25 = 31023100081 is a prime.
It is a super-2 number, since 2×310231001132 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31023100092 and 31023100101.
It is not an unprimeable number, because it can be changed into a prime (31023100103) 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, 13022781 + ... + 13025162.
It is an arithmetic number, because the mean of its divisors is an integer number (5183540856).
Almost surely, 231023100113 is an apocalyptic number.
It is an amenable number.
31023100113 is a deficient number, since it is larger than the sum of its proper divisors (10445226735).
31023100113 is a wasteful number, since it uses less digits than its factorization.
31023100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26048343.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 31023100113 its reverse (31100132013), we get a palindrome (62123232126).
The spelling of 31023100113 in words is "thirty-one billion, twenty-three million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •