Base | Representation |
---|---|
bin | 11000000011011101… |
… | …10011111111101101 |
3 | 1020022222212200000102 |
4 | 30001232303333231 |
5 | 202421432410301 |
6 | 5533234440445 |
7 | 635006525021 |
oct | 140156637755 |
9 | 36288780012 |
10 | 12913950701 |
11 | 5527652333 |
12 | 2604a33125 |
13 | 12aa604062 |
14 | 8a716a381 |
15 | 508b05b6b |
hex | 301bb3fed |
12913950701 has 2 divisors, whose sum is σ = 12913950702. Its totient is φ = 12913950700.
The previous prime is 12913950697. The next prime is 12913950713. The reversal of 12913950701 is 10705931921.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10831397476 + 2082553225 = 104074^2 + 45635^2 .
It is a cyclic number.
It is not a de Polignac number, because 12913950701 - 22 = 12913950697 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12913850701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6456975350 + 6456975351.
It is an arithmetic number, because the mean of its divisors is an integer number (6456975351).
Almost surely, 212913950701 is an apocalyptic number.
It is an amenable number.
12913950701 is a deficient number, since it is larger than the sum of its proper divisors (1).
12913950701 is an equidigital number, since it uses as much as digits as its factorization.
12913950701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010, while the sum is 38.
The spelling of 12913950701 in words is "twelve billion, nine hundred thirteen million, nine hundred fifty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •