Base | Representation |
---|---|
bin | 111001110111100001… |
… | …1100101111100110101 |
3 | 102212202120111221121200 |
4 | 1303233003211330311 |
5 | 4014001030441124 |
6 | 133031100403113 |
7 | 11656343464620 |
oct | 1635703457465 |
9 | 385676457550 |
10 | 124269780789 |
11 | 48780062680 |
12 | 20101846499 |
13 | b945985b8b |
14 | 602c444db7 |
15 | 3374c6abc9 |
hex | 1cef0e5f35 |
124269780789 has 48 divisors (see below), whose sum is σ = 227586378240. Its totient is φ = 63461544480.
The previous prime is 124269780727. The next prime is 124269780799. The reversal of 124269780789 is 987087962421.
It is not a de Polignac number, because 124269780789 - 28 = 124269780533 is a prime.
It is a super-2 number, since 2×1242697807892 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124269780709) 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, 1478787 + ... + 1560560.
It is an arithmetic number, because the mean of its divisors is an integer number (4741382880).
Almost surely, 2124269780789 is an apocalyptic number.
It is an amenable number.
124269780789 is a deficient number, since it is larger than the sum of its proper divisors (103316597451).
124269780789 is a wasteful number, since it uses less digits than its factorization.
124269780789 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3039430 (or 3039427 counting only the distinct ones).
The product of its (nonzero) digits is 24385536, while the sum is 63.
The spelling of 124269780789 in words is "one hundred twenty-four billion, two hundred sixty-nine million, seven hundred eighty thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •