Base | Representation |
---|---|
bin | 110000100010010011… |
… | …0010111100111111111 |
3 | 100222000222100220112010 |
4 | 1201010212113213333 |
5 | 3201430402432111 |
6 | 115514353142303 |
7 | 10346630302425 |
oct | 1410446274777 |
9 | 328028326463 |
10 | 104230124031 |
11 | 40227207980 |
12 | 1824a55a993 |
13 | 9aa1004a07 |
14 | 508ab99115 |
15 | 2aa07b9aa6 |
hex | 18449979ff |
104230124031 has 16 divisors (see below), whose sum is σ = 153870254208. Its totient is φ = 62226938400.
The previous prime is 104230123997. The next prime is 104230124051. The reversal of 104230124031 is 130421032401.
It is not a de Polignac number, because 104230124031 - 213 = 104230115839 is a prime.
It is a super-2 number, since 2×1042301240312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104230123989 and 104230124007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104230124051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23568600 + ... + 23573021.
It is an arithmetic number, because the mean of its divisors is an integer number (9616890888).
Almost surely, 2104230124031 is an apocalyptic number.
104230124031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104230124031 is a deficient number, since it is larger than the sum of its proper divisors (49640130177).
104230124031 is a wasteful number, since it uses less digits than its factorization.
104230124031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47141702.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 104230124031 its reverse (130421032401), we get a palindrome (234651156432).
The spelling of 104230124031 in words is "one hundred four billion, two hundred thirty million, one hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.317 sec. • engine limits •