Base | Representation |
---|---|
bin | 111001101111110011… |
… | …0001101101100010111 |
3 | 102212002111111002220010 |
4 | 1303133212031230113 |
5 | 4012433131433030 |
6 | 132545233411303 |
7 | 11650044120645 |
oct | 1633746155427 |
9 | 385074432803 |
10 | 124010421015 |
11 | 48657716858 |
12 | 2004aa09b33 |
13 | b904017160 |
14 | 6005c10195 |
15 | 335c0d86b0 |
hex | 1cdf98db17 |
124010421015 has 48 divisors (see below), whose sum is σ = 219018883104. Its totient is φ = 59562071040.
The previous prime is 124010421011. The next prime is 124010421023. The reversal of 124010421015 is 510124010421.
It is not a de Polignac number, because 124010421015 - 22 = 124010421011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 124010420982 and 124010421000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124010421011) 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 47 ways as a sum of consecutive naturals, for example, 138637 + ... + 516953.
It is an arithmetic number, because the mean of its divisors is an integer number (4562893398).
Almost surely, 2124010421015 is an apocalyptic number.
124010421015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
124010421015 is a deficient number, since it is larger than the sum of its proper divisors (95008462089).
124010421015 is a wasteful number, since it uses less digits than its factorization.
124010421015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378420 (or 378379 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 124010421015 its reverse (510124010421), we get a palindrome (634134431436).
The spelling of 124010421015 in words is "one hundred twenty-four billion, ten million, four hundred twenty-one thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •