Base | Representation |
---|---|
bin | 10111101000000000000111… |
… | …011001111000100010111111 |
3 | 111121220010022112100202201212 |
4 | 113220000013121320202333 |
5 | 102104330314100104214 |
6 | 1004552454245555035 |
7 | 30612546212431553 |
oct | 2750000731704277 |
9 | 447803275322655 |
10 | 103903973050559 |
11 | 3011a47801a400 |
12 | b7a1352415a7b |
13 | 45c91445a9026 |
14 | 1b92d9ca2b863 |
15 | c02baa24053e |
hex | 5e80076788bf |
103903973050559 has 24 divisors (see below), whose sum is σ = 115775465551536. Its totient is φ = 93162225340800.
The previous prime is 103903973050547. The next prime is 103903973050747. The reversal of 103903973050559 is 955050379309301.
It is not a de Polignac number, because 103903973050559 - 24 = 103903973050543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103903973050498 and 103903973050507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103903973050519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 552524969 + ... + 552712989.
It is an arithmetic number, because the mean of its divisors is an integer number (4823977731314).
Almost surely, 2103903973050559 is an apocalyptic number.
103903973050559 is a deficient number, since it is larger than the sum of its proper divisors (11871492500977).
103903973050559 is a wasteful number, since it uses less digits than its factorization.
103903973050559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250679 (or 250668 counting only the distinct ones).
The product of its (nonzero) digits is 17222625, while the sum is 59.
The spelling of 103903973050559 in words is "one hundred three trillion, nine hundred three billion, nine hundred seventy-three million, fifty thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •