Base | Representation |
---|---|
bin | 111001111011011110… |
… | …1100010101110001111 |
3 | 102220002211002100000201 |
4 | 1303312331202232033 |
5 | 4014234004144211 |
6 | 133052155234331 |
7 | 11662544026033 |
oct | 1636675425617 |
9 | 386084070021 |
10 | 124402412431 |
11 | 48838a11800 |
12 | 2013a1489a7 |
13 | b9672b343b |
14 | 6041ccc1c3 |
15 | 33817190c1 |
hex | 1cf6f62b8f |
124402412431 has 12 divisors (see below), whose sum is σ = 140435518216. Its totient is φ = 110036527920.
The previous prime is 124402412413. The next prime is 124402412441. The reversal of 124402412431 is 134214204421.
It is not a de Polignac number, because 124402412431 - 29 = 124402411919 is a prime.
It is a super-2 number, since 2×1244024124312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 124402412431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124402412441) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13889025 + ... + 13897978.
Almost surely, 2124402412431 is an apocalyptic number.
124402412431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
124402412431 is a deficient number, since it is larger than the sum of its proper divisors (16033105785).
124402412431 is a wasteful number, since it uses less digits than its factorization.
124402412431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27787062 (or 27787051 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 124402412431 its reverse (134214204421), we get a palindrome (258616616852).
The spelling of 124402412431 in words is "one hundred twenty-four billion, four hundred two million, four hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •