Base | Representation |
---|---|
bin | 11010000100101011… |
… | …10011100110000101 |
3 | 1100010112112201210211 |
4 | 31002111303212011 |
5 | 212131431231001 |
6 | 10232555515421 |
7 | 1003611211234 |
oct | 150225634605 |
9 | 40115481724 |
10 | 13997914501 |
11 | 5a3350438a |
12 | 2867a58b71 |
13 | 142105b85c |
14 | 96b0d2b1b |
15 | 56dd70351 |
hex | 342573985 |
13997914501 has 2 divisors, whose sum is σ = 13997914502. Its totient is φ = 13997914500.
The previous prime is 13997914477. The next prime is 13997914523. The reversal of 13997914501 is 10541979931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9216192001 + 4781722500 = 96001^2 + 69150^2 .
It is a cyclic number.
It is not a de Polignac number, because 13997914501 - 27 = 13997914373 is a prime.
It is a super-2 number, since 2×139979145012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13997914001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6998957250 + 6998957251.
It is an arithmetic number, because the mean of its divisors is an integer number (6998957251).
Almost surely, 213997914501 is an apocalyptic number.
It is an amenable number.
13997914501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13997914501 is an equidigital number, since it uses as much as digits as its factorization.
13997914501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 306180, while the sum is 49.
The spelling of 13997914501 in words is "thirteen billion, nine hundred ninety-seven million, nine hundred fourteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •