Base | Representation |
---|---|
bin | 10110110100010111… |
… | …00101110110101101 |
3 | 1011121202022010020111 |
4 | 23122023211312231 |
5 | 200042101000232 |
6 | 5343332420021 |
7 | 612401510212 |
oct | 133213456655 |
9 | 34552263214 |
10 | 12250406317 |
11 | 5217042646 |
12 | 245a777611 |
13 | 1202cba146 |
14 | 842da1b09 |
15 | 4ba735047 |
hex | 2da2e5dad |
12250406317 has 4 divisors (see below), whose sum is σ = 12251429280. Its totient is φ = 12249383356.
The previous prime is 12250406309. The next prime is 12250406327. The reversal of 12250406317 is 71360405221.
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, and also an emirpimes, since its reverse is a distinct semiprime: 71360405221 = 7 ⋅10194343603.
It is a cyclic number.
It is not a de Polignac number, because 12250406317 - 23 = 12250406309 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12250406327) 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, 493303 + ... + 517540.
It is an arithmetic number, because the mean of its divisors is an integer number (3062857320).
Almost surely, 212250406317 is an apocalyptic number.
It is an amenable number.
12250406317 is a deficient number, since it is larger than the sum of its proper divisors (1022963).
12250406317 is a wasteful number, since it uses less digits than its factorization.
12250406317 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1022962.
The product of its (nonzero) digits is 10080, while the sum is 31.
The spelling of 12250406317 in words is "twelve billion, two hundred fifty million, four hundred six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •