Base | Representation |
---|---|
bin | 111001110110111011… |
… | …1010110110001100001 |
3 | 102212201011220121012111 |
4 | 1303231313112301201 |
5 | 4013430421430211 |
6 | 133025104155321 |
7 | 11656011560164 |
oct | 1635567266141 |
9 | 385634817174 |
10 | 124249795681 |
11 | 4876a852560 |
12 | 200b7008b41 |
13 | b9417a947b |
14 | 6029921adb |
15 | 337311e421 |
hex | 1ceddd6c61 |
124249795681 has 4 divisors (see below), whose sum is σ = 135545231664. Its totient is φ = 112954359700.
The previous prime is 124249795673. The next prime is 124249795741. The reversal of 124249795681 is 186597942421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 124249795681 - 23 = 124249795673 is a prime.
It is a super-2 number, since 2×1242497956812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124249790681) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5647717975 + ... + 5647717996.
It is an arithmetic number, because the mean of its divisors is an integer number (33886307916).
Almost surely, 2124249795681 is an apocalyptic number.
124249795681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
124249795681 is a deficient number, since it is larger than the sum of its proper divisors (11295435983).
124249795681 is a wasteful number, since it uses less digits than its factorization.
124249795681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11295435982.
The product of its digits is 8709120, while the sum is 58.
The spelling of 124249795681 in words is "one hundred twenty-four billion, two hundred forty-nine million, seven hundred ninety-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •