Base | Representation |
---|---|
bin | 10111011011000100001000… |
… | …000001000011101011001111 |
3 | 111111202010112020202220111221 |
4 | 113123010020001003223033 |
5 | 102000244031310330422 |
6 | 1003032223034424211 |
7 | 30461403606440635 |
oct | 2733041001035317 |
9 | 444663466686457 |
10 | 103014925089487 |
11 | 2a90742568a554 |
12 | b678b95b92067 |
13 | 456335bb24238 |
14 | 1b61d3ddcd355 |
15 | bd99c447c3c7 |
hex | 5db108043acf |
103014925089487 has 2 divisors, whose sum is σ = 103014925089488. Its totient is φ = 103014925089486.
The previous prime is 103014925089389. The next prime is 103014925089577. The reversal of 103014925089487 is 784980529410301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103014925089487 - 27 = 103014925089359 is a prime.
It is a super-2 number, since 2×1030149250894872 (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 (103014925009487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51507462544743 + 51507462544744.
It is an arithmetic number, because the mean of its divisors is an integer number (51507462544744).
Almost surely, 2103014925089487 is an apocalyptic number.
103014925089487 is a deficient number, since it is larger than the sum of its proper divisors (1).
103014925089487 is an equidigital number, since it uses as much as digits as its factorization.
103014925089487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17418240, while the sum is 61.
The spelling of 103014925089487 in words is "one hundred three trillion, fourteen billion, nine hundred twenty-five million, eighty-nine thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •