Base | Representation |
---|---|
bin | 111001110110000010… |
… | …1110010001001110101 |
3 | 102212122002220000022220 |
4 | 1303230011302021311 |
5 | 4013400311222123 |
6 | 133022122112553 |
7 | 11655200530443 |
oct | 1635405621165 |
9 | 385562800286 |
10 | 124220023413 |
11 | 48754a68182 |
12 | 200a904b759 |
13 | b938584045 |
14 | 60259b1b93 |
15 | 33706dcce3 |
hex | 1cec172275 |
124220023413 has 8 divisors (see below), whose sum is σ = 165678614976. Its totient is φ = 82787390400.
The previous prime is 124220023357. The next prime is 124220023423. The reversal of 124220023413 is 314320022421.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 124220023413 - 28 = 124220023157 is a prime.
It is a super-2 number, since 2×1242200234132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124220023423) 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 7 ways as a sum of consecutive naturals, for example, 6478468 + ... + 6497613.
It is an arithmetic number, because the mean of its divisors is an integer number (20709826872).
Almost surely, 2124220023413 is an apocalyptic number.
It is an amenable number.
124220023413 is a deficient number, since it is larger than the sum of its proper divisors (41458591563).
124220023413 is a wasteful number, since it uses less digits than its factorization.
124220023413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12979275.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 124220023413 its reverse (314320022421), we get a palindrome (438540045834).
The spelling of 124220023413 in words is "one hundred twenty-four billion, two hundred twenty million, twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •