Base | Representation |
---|---|
bin | 111001101111100011… |
… | …0000110110111001111 |
3 | 102212001220122111111210 |
4 | 1303133012012313033 |
5 | 4012424003120211 |
6 | 132544333145503 |
7 | 11646612434544 |
oct | 1633706066717 |
9 | 385056574453 |
10 | 124002004431 |
11 | 486529982a8 |
12 | 2004802b293 |
13 | b90235b226 |
14 | 6004a5cbcb |
15 | 335b4c49a6 |
hex | 1cdf186dcf |
124002004431 has 16 divisors (see below), whose sum is σ = 172758055680. Its totient is φ = 78966708480.
The previous prime is 124002004417. The next prime is 124002004463. The reversal of 124002004431 is 134400200421.
It is not a de Polignac number, because 124002004431 - 210 = 124002003407 is a prime.
It is a super-3 number, since 3×1240020044313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 124002004398 and 124002004407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124002004471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1164930 + ... + 1266911.
It is an arithmetic number, because the mean of its divisors is an integer number (10797378480).
Almost surely, 2124002004431 is an apocalyptic number.
124002004431 is a deficient number, since it is larger than the sum of its proper divisors (48756051249).
124002004431 is a wasteful number, since it uses less digits than its factorization.
124002004431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2432606.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 124002004431 its reverse (134400200421), we get a palindrome (258402204852).
The spelling of 124002004431 in words is "one hundred twenty-four billion, two million, four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •