Base | Representation |
---|---|
bin | 111001110111100110… |
… | …0111000010011100110 |
3 | 102212202202002122002122 |
4 | 1303233030320103212 |
5 | 4014002141342040 |
6 | 133031224505542 |
7 | 11656403254340 |
oct | 1635714702346 |
9 | 385682078078 |
10 | 124272215270 |
11 | 48781475745 |
12 | 2010261b2b2 |
13 | b946328cb8 |
14 | 602c8ba290 |
15 | 337509c1b5 |
hex | 1cef3384e6 |
124272215270 has 64 divisors (see below), whose sum is σ = 270737303040. Its totient is φ = 40093343232.
The previous prime is 124272215269. The next prime is 124272215293. The reversal of 124272215270 is 72512272421.
It is a super-2 number, since 2×1242722152702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 124272215270.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10402961 + ... + 10414899.
It is an arithmetic number, because the mean of its divisors is an integer number (4230270360).
Almost surely, 2124272215270 is an apocalyptic number.
124272215270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
124272215270 is an abundant number, since it is smaller than the sum of its proper divisors (146465087770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124272215270 is a wasteful number, since it uses less digits than its factorization.
124272215270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20717.
The product of its (nonzero) digits is 31360, while the sum is 35.
Adding to 124272215270 its reverse (72512272421), we get a palindrome (196784487691).
The spelling of 124272215270 in words is "one hundred twenty-four billion, two hundred seventy-two million, two hundred fifteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •