Base | Representation |
---|---|
bin | 1011001001010000010110… |
… | …1011011000010100100011 |
3 | 1121101102210000202100000201 |
4 | 2302110011223120110203 |
5 | 3101230422030002004 |
6 | 42021124302130031 |
7 | 2403203355362623 |
oct | 262240553302443 |
9 | 47342700670021 |
10 | 12253636953379 |
11 | 39a4813676a48 |
12 | 145aa06280917 |
13 | 6ab6890c97a3 |
14 | 30511743c883 |
15 | 163b2a19a6a4 |
hex | b2505ad8523 |
12253636953379 has 2 divisors, whose sum is σ = 12253636953380. Its totient is φ = 12253636953378.
The previous prime is 12253636953377. The next prime is 12253636953391. The reversal of 12253636953379 is 97335963635221.
It is a weak prime.
It is an emirp because it is prime and its reverse (97335963635221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12253636953379 - 21 = 12253636953377 is a prime.
Together with 12253636953377, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12253636953379.
It is not a weakly prime, because it can be changed into another prime (12253636953377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6126818476689 + 6126818476690.
It is an arithmetic number, because the mean of its divisors is an integer number (6126818476690).
Almost surely, 212253636953379 is an apocalyptic number.
12253636953379 is a deficient number, since it is larger than the sum of its proper divisors (1).
12253636953379 is an equidigital number, since it uses as much as digits as its factorization.
12253636953379 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 165337200, while the sum is 64.
The spelling of 12253636953379 in words is "twelve trillion, two hundred fifty-three billion, six hundred thirty-six million, nine hundred fifty-three thousand, three hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •