Base | Representation |
---|---|
bin | 110000110001010100… |
… | …0101110111011011101 |
3 | 101000100002121112001122 |
4 | 1201202220232323131 |
5 | 3203443404412003 |
6 | 120040354220325 |
7 | 10365256552304 |
oct | 1414250567335 |
9 | 330302545048 |
10 | 104734060253 |
11 | 40465712699 |
12 | 1836b2846a5 |
13 | 9b51537624 |
14 | 50d7a9743b |
15 | 2aceb5e238 |
hex | 1862a2eedd |
104734060253 has 4 divisors (see below), whose sum is σ = 104748354048. Its totient is φ = 104719766460.
The previous prime is 104734060247. The next prime is 104734060271. The reversal of 104734060253 is 352060437401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 352060437401 = 1249 ⋅281873849.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104734060253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104734060553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7135901 + ... + 7150562.
It is an arithmetic number, because the mean of its divisors is an integer number (26187088512).
Almost surely, 2104734060253 is an apocalyptic number.
It is an amenable number.
104734060253 is a deficient number, since it is larger than the sum of its proper divisors (14293795).
104734060253 is an equidigital number, since it uses as much as digits as its factorization.
104734060253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14293794.
The product of its (nonzero) digits is 60480, while the sum is 35.
Adding to 104734060253 its reverse (352060437401), we get a palindrome (456794497654).
The spelling of 104734060253 in words is "one hundred four billion, seven hundred thirty-four million, sixty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •