Base | Representation |
---|---|
bin | 10111000010101010… |
… | …11011010101001001 |
3 | 1011221010010201010212 |
4 | 23201111123111021 |
5 | 200313312101121 |
6 | 5403301050505 |
7 | 615356610323 |
oct | 134125332511 |
9 | 34833121125 |
10 | 12370425161 |
11 | 5278867576 |
12 | 24929b6a35 |
13 | 1221b1c803 |
14 | 854cc4613 |
15 | 4c604125b |
hex | 2e155b549 |
12370425161 has 4 divisors (see below), whose sum is σ = 12519466512. Its totient is φ = 12221383812.
The previous prime is 12370425127. The next prime is 12370425187. The reversal of 12370425161 is 16152407321.
12370425161 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12370425161 - 218 = 12370163017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12370425191) 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, 74520551 + ... + 74520716.
It is an arithmetic number, because the mean of its divisors is an integer number (3129866628).
Almost surely, 212370425161 is an apocalyptic number.
It is an amenable number.
12370425161 is a deficient number, since it is larger than the sum of its proper divisors (149041351).
12370425161 is an equidigital number, since it uses as much as digits as its factorization.
12370425161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149041350.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 12370425161 in words is "twelve billion, three hundred seventy million, four hundred twenty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •