Base | Representation |
---|---|
bin | 1110111100110011… |
… | …0001001101101011 |
3 | 101100200100200220212 |
4 | 3233030301031223 |
5 | 31204323230211 |
6 | 1502114411335 |
7 | 201306542426 |
oct | 35714611553 |
9 | 11320320825 |
10 | 4013101931 |
11 | 177a322973 |
12 | 93bb90b4b |
13 | 4bc55b137 |
14 | 2a0da49bd |
15 | 1874b238b |
hex | ef33136b |
4013101931 has 4 divisors (see below), whose sum is σ = 4142556864. Its totient is φ = 3883647000.
The previous prime is 4013101921. The next prime is 4013101999. The reversal of 4013101931 is 1391013104.
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 4013101931 - 210 = 4013100907 is a prime.
It is a super-2 number, since 2×40131019312 = 32209974217191857522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4013101897 and 4013101906.
It is not an unprimeable number, because it can be changed into a prime (4013101921) 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, 64727420 + ... + 64727481.
It is an arithmetic number, because the mean of its divisors is an integer number (1035639216).
Almost surely, 24013101931 is an apocalyptic number.
4013101931 is a deficient number, since it is larger than the sum of its proper divisors (129454933).
4013101931 is a wasteful number, since it uses less digits than its factorization.
4013101931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129454932.
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 4013101931 is about 63349.0483827500. The cubic root of 4013101931 is about 1589.1323313376.
The spelling of 4013101931 in words is "four billion, thirteen million, one hundred one thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •