Base | Representation |
---|---|
bin | 111010000010011101… |
… | …1001000111010010001 |
3 | 102220201010212112000001 |
4 | 1310010323020322101 |
5 | 4020223441212231 |
6 | 133131324130001 |
7 | 12001420105423 |
oct | 1640473107221 |
9 | 386633775001 |
10 | 124636663441 |
11 | 48949168a84 |
12 | 201a4696901 |
13 | b9a39a05c4 |
14 | 6065068813 |
15 | 339708bb61 |
hex | 1d04ec8e91 |
124636663441 has 32 divisors (see below), whose sum is σ = 134104117248. Its totient is φ = 115560846720.
The previous prime is 124636663421. The next prime is 124636663447. The reversal of 124636663441 is 144366636421.
It is not a de Polignac number, because 124636663441 - 29 = 124636662929 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124636663391 and 124636663400.
It is not an unprimeable number, because it can be changed into a prime (124636663447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58322125 + ... + 58324261.
It is an arithmetic number, because the mean of its divisors is an integer number (4190753664).
Almost surely, 2124636663441 is an apocalyptic number.
It is an amenable number.
124636663441 is a deficient number, since it is larger than the sum of its proper divisors (9467453807).
124636663441 is a wasteful number, since it uses less digits than its factorization.
124636663441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2701.
The product of its digits is 1492992, while the sum is 46.
The spelling of 124636663441 in words is "one hundred twenty-four billion, six hundred thirty-six million, six hundred sixty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •