Base | Representation |
---|---|
bin | 10111001010111110… |
… | …01110000101100111 |
3 | 1012002222020121201202 |
4 | 23211133032011213 |
5 | 200434131214343 |
6 | 5414230313115 |
7 | 620164054454 |
oct | 134537160547 |
9 | 35088217652 |
10 | 12440101223 |
11 | 53041271a0 |
12 | 24b21b879b |
13 | 12333a6a54 |
14 | 86026082b |
15 | 4cc205db8 |
hex | 2e57ce167 |
12440101223 has 32 divisors (see below), whose sum is σ = 14203812672. Its totient is φ = 10795033600.
The previous prime is 12440101217. The next prime is 12440101229. The reversal of 12440101223 is 32210104421.
It is an interprime number because it is at equal distance from previous prime (12440101217) and next prime (12440101229).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12440101223 is a prime.
It is a super-2 number, since 2×124401012232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12440101195 and 12440101204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12440101229) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15608261 + ... + 15609057.
It is an arithmetic number, because the mean of its divisors is an integer number (443869146).
Almost surely, 212440101223 is an apocalyptic number.
12440101223 is a deficient number, since it is larger than the sum of its proper divisors (1763711449).
12440101223 is a wasteful number, since it uses less digits than its factorization.
12440101223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1555.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12440101223 its reverse (32210104421), we get a palindrome (44650205644).
The spelling of 12440101223 in words is "twelve billion, four hundred forty million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •