Base | Representation |
---|---|
bin | 111001111010000100… |
… | …0110011110110100010 |
3 | 102212222111221021202122 |
4 | 1303310020303312202 |
5 | 4014134342101110 |
6 | 133043343544242 |
7 | 11661430232036 |
oct | 1636410636642 |
9 | 385874837678 |
10 | 124355034530 |
11 | 488141a2011 |
12 | 201262bb082 |
13 | b95a53568c |
14 | 60398b81c6 |
15 | 337c4ab255 |
hex | 1cf4233da2 |
124355034530 has 8 divisors (see below), whose sum is σ = 223839062172. Its totient is φ = 49742013808.
The previous prime is 124355034481. The next prime is 124355034533. The reversal of 124355034530 is 35430553421.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 121865922649 + 2489111881 = 349093^2 + 49891^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1243550345302 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (124355034533) 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, 6217751717 + ... + 6217751736.
Almost surely, 2124355034530 is an apocalyptic number.
124355034530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
124355034530 is a deficient number, since it is larger than the sum of its proper divisors (99484027642).
124355034530 is a wasteful number, since it uses less digits than its factorization.
124355034530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12435503460.
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 124355034530 its reverse (35430553421), we get a palindrome (159785587951).
The spelling of 124355034530 in words is "one hundred twenty-four billion, three hundred fifty-five million, thirty-four thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •