Base | Representation |
---|---|
bin | 111001111011011111… |
… | …0001000010101000100 |
3 | 102220002211101011022210 |
4 | 1303312332020111010 |
5 | 4014234024111333 |
6 | 133052202423420 |
7 | 11662545240105 |
oct | 1636676102504 |
9 | 386084334283 |
10 | 124402566468 |
11 | 48839007504 |
12 | 2013a201b70 |
13 | b96733859b |
14 | 6041d2c3ac |
15 | 3381749a63 |
hex | 1cf6f88544 |
124402566468 has 12 divisors (see below), whose sum is σ = 290272655120. Its totient is φ = 41467522152.
The previous prime is 124402566467. The next prime is 124402566469. The reversal of 124402566468 is 864665204421.
124402566468 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (124402566467) and next prime (124402566469).
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (124402566461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5183440258 + ... + 5183440281.
Almost surely, 2124402566468 is an apocalyptic number.
It is an amenable number.
124402566468 is an abundant number, since it is smaller than the sum of its proper divisors (165870088652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124402566468 is a wasteful number, since it uses less digits than its factorization.
124402566468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10366880546 (or 10366880544 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 48.
The spelling of 124402566468 in words is "one hundred twenty-four billion, four hundred two million, five hundred sixty-six thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •