Base | Representation |
---|---|
bin | 1110111100110001… |
… | …1001010101011011 |
3 | 101100200011201202100 |
4 | 3233030121111123 |
5 | 31204312112443 |
6 | 1502112334443 |
7 | 201305654322 |
oct | 35714312533 |
9 | 11320151670 |
10 | 4013004123 |
11 | 177a266437 |
12 | 93bb44423 |
13 | 4bc52576b |
14 | 2a0d7b0b9 |
15 | 1874933d3 |
hex | ef31955b |
4013004123 has 12 divisors (see below), whose sum is σ = 5814851328. Its totient is φ = 2666894640.
The previous prime is 4013004103. The next prime is 4013004167. The reversal of 4013004123 is 3214003104.
It is not a de Polignac number, because 4013004123 - 221 = 4010906971 is a prime.
It is a super-2 number, since 2×40130041232 = 32208404182429998258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4013004096 and 4013004105.
It is not an unprimeable number, because it can be changed into a prime (4013004103) 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 11 ways as a sum of consecutive naturals, for example, 700443 + ... + 706148.
It is an arithmetic number, because the mean of its divisors is an integer number (484570944).
Almost surely, 24013004123 is an apocalyptic number.
4013004123 is a deficient number, since it is larger than the sum of its proper divisors (1801847205).
4013004123 is a wasteful number, since it uses less digits than its factorization.
4013004123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1406914 (or 1406911 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 4013004123 is about 63348.2764011776. The cubic root of 4013004123 is about 1589.1194210320.
Adding to 4013004123 its reverse (3214003104), we get a palindrome (7227007227).
The spelling of 4013004123 in words is "four billion, thirteen million, four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •