Base | Representation |
---|---|
bin | 10111100100000000… |
… | …10100010111100011 |
3 | 1012122121101212210011 |
4 | 23302000110113203 |
5 | 201401411314131 |
6 | 5451131345351 |
7 | 625324053346 |
oct | 136200242743 |
9 | 35577355704 |
10 | 12650104291 |
11 | 5401721650 |
12 | 25505b2257 |
13 | 1267a54116 |
14 | 8800c845d |
15 | 4e08890b1 |
hex | 2f20145e3 |
12650104291 has 4 divisors (see below), whose sum is σ = 13800113784. Its totient is φ = 11500094800.
The previous prime is 12650104231. The next prime is 12650104301. The reversal of 12650104291 is 19240105621.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12650104291 - 213 = 12650096099 is a prime.
It is a super-2 number, since 2×126501042912 (a number of 21 digits) contains 22 as substring.
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 not an unprimeable number, because it can be changed into a prime (12650104231) 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, 575004730 + ... + 575004751.
It is an arithmetic number, because the mean of its divisors is an integer number (3450028446).
Almost surely, 212650104291 is an apocalyptic number.
12650104291 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12650104291 is a deficient number, since it is larger than the sum of its proper divisors (1150009493).
12650104291 is a wasteful number, since it uses less digits than its factorization.
12650104291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150009492.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 12650104291 in words is "twelve billion, six hundred fifty million, one hundred four thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •