Base | Representation |
---|---|
bin | 10111101001010010… |
… | …01110100000100001 |
3 | 1012202200201110020110 |
4 | 23310221032200201 |
5 | 201444230221000 |
6 | 5455352401533 |
7 | 626402320611 |
oct | 136451164041 |
9 | 35680643213 |
10 | 12694382625 |
11 | 5424714611 |
12 | 25633a62a9 |
13 | 1273c88112 |
14 | 885d32a41 |
15 | 4e46d3850 |
hex | 2f4a4e821 |
12694382625 has 32 divisors (see below), whose sum is σ = 21156505344. Its totient is φ = 6759744000.
The previous prime is 12694382611. The next prime is 12694382639. The reversal of 12694382625 is 52628349621.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12694382611) and next prime (12694382639).
It is not a de Polignac number, because 12694382625 - 211 = 12694380577 is a prime.
It is a super-2 number, since 2×126943826252 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 216465 + ... + 268785.
It is an arithmetic number, because the mean of its divisors is an integer number (661140792).
Almost surely, 212694382625 is an apocalyptic number.
12694382625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12694382625 is a deficient number, since it is larger than the sum of its proper divisors (8462122719).
12694382625 is an equidigital number, since it uses as much as digits as its factorization.
12694382625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52986 (or 52976 counting only the distinct ones).
The product of its digits is 1244160, while the sum is 48.
The spelling of 12694382625 in words is "twelve billion, six hundred ninety-four million, three hundred eighty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •