Base | Representation |
---|---|
bin | 110000011011111001… |
… | …1010110001110010001 |
3 | 100221111000100221012010 |
4 | 1200313303112032101 |
5 | 3201010422003403 |
6 | 115441203253133 |
7 | 10341412334133 |
oct | 1406763261621 |
9 | 327430327163 |
10 | 104015422353 |
11 | 40126aa3377 |
12 | 181aa67a1a9 |
13 | 9a686a0abb |
14 | 506a46b053 |
15 | 2a8ba09603 |
hex | 1837cd6391 |
104015422353 has 8 divisors (see below), whose sum is σ = 138691836448. Its totient is φ = 69341311584.
The previous prime is 104015422339. The next prime is 104015422393. The reversal of 104015422353 is 353224510401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104015422353 - 229 = 103478551441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 104015422353.
It is not an unprimeable number, because it can be changed into a prime (104015422393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 467551 + ... + 653172.
It is an arithmetic number, because the mean of its divisors is an integer number (17336479556).
Almost surely, 2104015422353 is an apocalyptic number.
It is an amenable number.
104015422353 is a deficient number, since it is larger than the sum of its proper divisors (34676414095).
104015422353 is a wasteful number, since it uses less digits than its factorization.
104015422353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1151663.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 104015422353 its reverse (353224510401), we get a palindrome (457239932754).
The spelling of 104015422353 in words is "one hundred four billion, fifteen million, four hundred twenty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •