Base | Representation |
---|---|
bin | 1011001001000111110001… |
… | …0000000011000110111101 |
3 | 1121101012211100021111220222 |
4 | 2302101330100003012331 |
5 | 3101211211303410023 |
6 | 42020103420151125 |
7 | 2403062260625405 |
oct | 262217420030675 |
9 | 47335740244828 |
10 | 12251331310013 |
11 | 39a3840150a64 |
12 | 145a4820984a5 |
13 | 6ab3ac529a83 |
14 | 304d79141805 |
15 | 163a42a61cc8 |
hex | b247c4031bd |
12251331310013 has 2 divisors, whose sum is σ = 12251331310014. Its totient is φ = 12251331310012.
The previous prime is 12251331309989. The next prime is 12251331310027. The reversal of 12251331310013 is 31001313315221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10476369305284 + 1774962004729 = 3236722^2 + 1332277^2 .
It is an emirp because it is prime and its reverse (31001313315221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12251331310013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12251331810013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6125665655006 + 6125665655007.
It is an arithmetic number, because the mean of its divisors is an integer number (6125665655007).
Almost surely, 212251331310013 is an apocalyptic number.
It is an amenable number.
12251331310013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12251331310013 is an equidigital number, since it uses as much as digits as its factorization.
12251331310013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 12251331310013 its reverse (31001313315221), we get a palindrome (43252644625234).
The spelling of 12251331310013 in words is "twelve trillion, two hundred fifty-one billion, three hundred thirty-one million, three hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •