Base | Representation |
---|---|
bin | 101111111110101010… |
… | …1011111001111010001 |
3 | 100211221122121202020020 |
4 | 1133331111133033101 |
5 | 3142003314011213 |
6 | 115200003134053 |
7 | 10305201640122 |
oct | 1377525371721 |
9 | 324848552206 |
10 | 103034516433 |
11 | 3a773331222 |
12 | 17b76074329 |
13 | 99403ba8b4 |
14 | 4db6090049 |
15 | 2a3084a923 |
hex | 17fd55f3d1 |
103034516433 has 16 divisors (see below), whose sum is σ = 138927799296. Its totient is φ = 67917520080.
The previous prime is 103034516423. The next prime is 103034516443. The reversal of 103034516433 is 334615430301.
It is an interprime number because it is at equal distance from previous prime (103034516423) and next prime (103034516443).
It is not a de Polignac number, because 103034516433 - 26 = 103034516369 is a prime.
It is a super-2 number, since 2×1030345164332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103034516394 and 103034516403.
It is not an unprimeable number, because it can be changed into a prime (103034516423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57763 + ... + 457608.
It is an arithmetic number, because the mean of its divisors is an integer number (8682987456).
Almost surely, 2103034516433 is an apocalyptic number.
It is an amenable number.
103034516433 is a deficient number, since it is larger than the sum of its proper divisors (35893282863).
103034516433 is a wasteful number, since it uses less digits than its factorization.
103034516433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516124.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 103034516433 its reverse (334615430301), we get a palindrome (437649946734).
The spelling of 103034516433 in words is "one hundred three billion, thirty-four million, five hundred sixteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •