Base | Representation |
---|---|
bin | 110000111111101000… |
… | …0100001100011110001 |
3 | 101001120120011212002012 |
4 | 1201333100201203301 |
5 | 3210434322101142 |
6 | 120200150332305 |
7 | 10413210253106 |
oct | 1417720414361 |
9 | 331516155065 |
10 | 105214253297 |
11 | 4069178084a |
12 | 1848405a095 |
13 | 9bc9b7611a |
14 | 5141774aad |
15 | 2b0bdb3882 |
hex | 187f4218f1 |
105214253297 has 2 divisors, whose sum is σ = 105214253298. Its totient is φ = 105214253296.
The previous prime is 105214253237. The next prime is 105214253299. The reversal of 105214253297 is 792352412501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66782963776 + 38431289521 = 258424^2 + 196039^2 .
It is a cyclic number.
It is not a de Polignac number, because 105214253297 - 26 = 105214253233 is a prime.
It is a super-2 number, since 2×1052142532972 (a number of 23 digits) contains 22 as substring.
Together with 105214253299, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (105214253299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52607126648 + 52607126649.
It is an arithmetic number, because the mean of its divisors is an integer number (52607126649).
Almost surely, 2105214253297 is an apocalyptic number.
It is an amenable number.
105214253297 is a deficient number, since it is larger than the sum of its proper divisors (1).
105214253297 is an equidigital number, since it uses as much as digits as its factorization.
105214253297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 151200, while the sum is 41.
Adding to 105214253297 its reverse (792352412501), we get a palindrome (897566665798).
The spelling of 105214253297 in words is "one hundred five billion, two hundred fourteen million, two hundred fifty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •