Base | Representation |
---|---|
bin | 111001101111110110… |
… | …0011100101011010101 |
3 | 102212002121120010122110 |
4 | 1303133230130223111 |
5 | 4012434041232003 |
6 | 132545332421233 |
7 | 11650064035332 |
oct | 1633754345325 |
9 | 385077503573 |
10 | 124012055253 |
11 | 48658632669 |
12 | 2004b477819 |
13 | b904469c68 |
14 | 6006117989 |
15 | 335c30ca03 |
hex | 1cdfb1cad5 |
124012055253 has 8 divisors (see below), whose sum is σ = 169818310048. Its totient is φ = 80440251984.
The previous prime is 124012055227. The next prime is 124012055257. The reversal of 124012055253 is 352550210421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 124012055253 - 233 = 115422120661 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 124012055253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124012055257) 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 7 ways as a sum of consecutive naturals, for example, 558612751 + ... + 558612972.
It is an arithmetic number, because the mean of its divisors is an integer number (21227288756).
Almost surely, 2124012055253 is an apocalyptic number.
It is an amenable number.
124012055253 is a deficient number, since it is larger than the sum of its proper divisors (45806254795).
124012055253 is a wasteful number, since it uses less digits than its factorization.
124012055253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117225763.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 124012055253 its reverse (352550210421), we get a palindrome (476562265674).
The spelling of 124012055253 in words is "one hundred twenty-four billion, twelve million, fifty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •