Base | Representation |
---|---|
bin | 101111111110100111… |
… | …1110101100100100001 |
3 | 100211221112211111010212 |
4 | 1133331033311210201 |
5 | 3142002424110131 |
6 | 115155511303505 |
7 | 10305153230156 |
oct | 1377517654441 |
9 | 324845744125 |
10 | 103033035041 |
11 | 3a77250a232 |
12 | 17b7567ab95 |
13 | 993ccbc531 |
14 | 4db5bc622d |
15 | 2a30656a2b |
hex | 17fd3f5921 |
103033035041 has 8 divisors (see below), whose sum is σ = 103166563584. Its totient is φ = 102899553120.
The previous prime is 103033035019. The next prime is 103033035067. The reversal of 103033035041 is 140530330301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103033035041 - 210 = 103033034017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103033034998 and 103033035016.
It is not an unprimeable number, because it can be changed into a prime (103033035341) 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 7 ways as a sum of consecutive naturals, for example, 6995501 + ... + 7010213.
It is an arithmetic number, because the mean of its divisors is an integer number (12895820448).
Almost surely, 2103033035041 is an apocalyptic number.
It is an amenable number.
103033035041 is a deficient number, since it is larger than the sum of its proper divisors (133528543).
103033035041 is an equidigital number, since it uses as much as digits as its factorization.
103033035041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23311.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 103033035041 its reverse (140530330301), we get a palindrome (243563365342).
The spelling of 103033035041 in words is "one hundred three billion, thirty-three million, thirty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •