Base | Representation |
---|---|
bin | 11000000100111000… |
… | …11111101000100111 |
3 | 1020100211102001221022 |
4 | 30002130133220213 |
5 | 202433014112202 |
6 | 5534343241355 |
7 | 635213362145 |
oct | 140234375047 |
9 | 36324361838 |
10 | 12925925927 |
11 | 5533391512 |
12 | 2608a4925b |
13 | 12acc379a5 |
14 | 8a89a6595 |
15 | 509bbdea2 |
hex | 30271fa27 |
12925925927 has 4 divisors (see below), whose sum is σ = 12939576216. Its totient is φ = 12912275640.
The previous prime is 12925925899. The next prime is 12925925939. The reversal of 12925925927 is 72952952921.
12925925927 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12925925927 - 26 = 12925925863 is a prime.
It is a super-2 number, since 2×129259259272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12925925977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6823724 + ... + 6825617.
It is an arithmetic number, because the mean of its divisors is an integer number (3234894054).
Almost surely, 212925925927 is an apocalyptic number.
12925925927 is a deficient number, since it is larger than the sum of its proper divisors (13650289).
12925925927 is an equidigital number, since it uses as much as digits as its factorization.
12925925927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13650288.
The product of its digits is 2041200, while the sum is 53.
The spelling of 12925925927 in words is "twelve billion, nine hundred twenty-five million, nine hundred twenty-five thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •