Base | Representation |
---|---|
bin | 1011010100110101110010… |
… | …1101100100011000110101 |
3 | 1122002110111200100012202002 |
4 | 2311031130231210120311 |
5 | 3113011024400444001 |
6 | 42252401533425045 |
7 | 2423450443325642 |
oct | 265153455443065 |
9 | 48073450305662 |
10 | 12452665640501 |
11 | 3a71167128429 |
12 | 14914b063b185 |
13 | 6c4387113cc8 |
14 | 3109d851cdc9 |
15 | 168dc820846b |
hex | b535cb64635 |
12452665640501 has 2 divisors, whose sum is σ = 12452665640502. Its totient is φ = 12452665640500.
The previous prime is 12452665640489. The next prime is 12452665640549. The reversal of 12452665640501 is 10504656625421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12190055513476 + 262610127025 = 3491426^2 + 512455^2 .
It is a cyclic number.
It is not a de Polignac number, because 12452665640501 - 218 = 12452665378357 is a prime.
It is a super-2 number, since 2×124526656405012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12452665640581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6226332820250 + 6226332820251.
It is an arithmetic number, because the mean of its divisors is an integer number (6226332820251).
Almost surely, 212452665640501 is an apocalyptic number.
It is an amenable number.
12452665640501 is a deficient number, since it is larger than the sum of its proper divisors (1).
12452665640501 is an equidigital number, since it uses as much as digits as its factorization.
12452665640501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728000, while the sum is 47.
The spelling of 12452665640501 in words is "twelve trillion, four hundred fifty-two billion, six hundred sixty-five million, six hundred forty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •