Base | Representation |
---|---|
bin | 111001110011000110… |
… | …1111101110011110100 |
3 | 102212101020111202111020 |
4 | 1303212031331303310 |
5 | 4013200101130022 |
6 | 133004242341140 |
7 | 11652563246001 |
oct | 1634615756364 |
9 | 385336452436 |
10 | 124121505012 |
11 | 4870439890a |
12 | 2008005a7b0 |
13 | b92103ba2b |
14 | 60168888a8 |
15 | 3366c2c35c |
hex | 1ce637dcf4 |
124121505012 has 24 divisors (see below), whose sum is σ = 290605306656. Its totient is φ = 41232626208.
The previous prime is 124121505007. The next prime is 124121505023. The reversal of 124121505012 is 210505121421.
It is a happy number.
It is a super-2 number, since 2×1241215050122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 17647438 + ... + 17654469.
It is an arithmetic number, because the mean of its divisors is an integer number (12108554444).
Almost surely, 2124121505012 is an apocalyptic number.
124121505012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
124121505012 is an abundant number, since it is smaller than the sum of its proper divisors (166483801644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124121505012 is a wasteful number, since it uses less digits than its factorization.
124121505012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35302207 (or 35302205 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 124121505012 its reverse (210505121421), we get a palindrome (334626626433).
The spelling of 124121505012 in words is "one hundred twenty-four billion, one hundred twenty-one million, five hundred five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •