Base | Representation |
---|---|
bin | 11100001111100001110011… |
… | …111111100000111001111011 |
3 | 121021210120220201222101002012 |
4 | 130033201303333200321323 |
5 | 112240043443424330021 |
6 | 1120102220001000135 |
7 | 35110023033311342 |
oct | 3417416377407173 |
9 | 537716821871065 |
10 | 124212400230011 |
11 | 3663a2017a0355 |
12 | 11b2124162304b |
13 | 544024359b282 |
14 | 2295cab2d2b59 |
15 | e560b251235b |
hex | 70f873fe0e7b |
124212400230011 has 4 divisors (see below), whose sum is σ = 124213233130800. Its totient is φ = 124211567329224.
The previous prime is 124212400230001. The next prime is 124212400230043. The reversal of 124212400230011 is 110032004212421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 124212400230011 - 26 = 124212400229947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124212400230001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 416226656 + ... + 416524973.
It is an arithmetic number, because the mean of its divisors is an integer number (31053308282700).
Almost surely, 2124212400230011 is an apocalyptic number.
124212400230011 is a deficient number, since it is larger than the sum of its proper divisors (832900789).
124212400230011 is an equidigital number, since it uses as much as digits as its factorization.
124212400230011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832900788.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 124212400230011 its reverse (110032004212421), we get a palindrome (234244404442432).
The spelling of 124212400230011 in words is "one hundred twenty-four trillion, two hundred twelve billion, four hundred million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •