Base | Representation |
---|---|
bin | 10111111110101001101001… |
… | …010010010100001101000101 |
3 | 111211101220201010211100221121 |
4 | 113332221221102110031011 |
5 | 102310330341202120023 |
6 | 1012143500315313541 |
7 | 31133155601165356 |
oct | 2776515122241505 |
9 | 454356633740847 |
10 | 105460393395013 |
11 | 3066a5577a7638 |
12 | b9b2b2044b8b1 |
13 | 46acb45943827 |
14 | 1c0844b575d2d |
15 | c2d400948d5d |
hex | 5fea69494345 |
105460393395013 has 2 divisors, whose sum is σ = 105460393395014. Its totient is φ = 105460393395012.
The previous prime is 105460393394927. The next prime is 105460393395037. The reversal of 105460393395013 is 310593393064501.
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., 84675018821409 + 20785374573604 = 9201903^2 + 4559098^2 .
It is a cyclic number.
It is not a de Polignac number, because 105460393395013 - 29 = 105460393394501 is a prime.
It is a super-2 number, since 2×1054603933950132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105460393395083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52730196697506 + 52730196697507.
It is an arithmetic number, because the mean of its divisors is an integer number (52730196697507).
Almost surely, 2105460393395013 is an apocalyptic number.
It is an amenable number.
105460393395013 is a deficient number, since it is larger than the sum of its proper divisors (1).
105460393395013 is an equidigital number, since it uses as much as digits as its factorization.
105460393395013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3936600, while the sum is 52.
The spelling of 105460393395013 in words is "one hundred five trillion, four hundred sixty billion, three hundred ninety-three million, three hundred ninety-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •