Base | Representation |
---|---|
bin | 10111101111010000111101… |
… | …110001111110011111100010 |
3 | 111200122211122122200021111022 |
4 | 113233100331301332133202 |
5 | 102141020022443323440 |
6 | 1010014042301445442 |
7 | 30663606116550101 |
oct | 2757207561763742 |
9 | 450584578607438 |
10 | 104403101542370 |
11 | 302a211a0458a4 |
12 | b86202b570882 |
13 | 4634229cc7a87 |
14 | 1bad1cc1d0038 |
15 | c10b6e5c3cb5 |
hex | 5ef43dc7e7e2 |
104403101542370 has 16 divisors (see below), whose sum is σ = 187925877431928. Its totient is φ = 41761175137920.
The previous prime is 104403101542339. The next prime is 104403101542381. The reversal of 104403101542370 is 73245101304401.
It can be written as a sum of positive squares in 4 ways, for example, as 87336445087609 + 17066656454761 = 9345397^2 + 4131181^2 .
It is a super-2 number, since 2×1044031015423702 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 104403101542370.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1204721 + ... + 14500260.
Almost surely, 2104403101542370 is an apocalyptic number.
104403101542370 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104403101542370 is a deficient number, since it is larger than the sum of its proper divisors (83522775889558).
104403101542370 is a wasteful number, since it uses less digits than its factorization.
104403101542370 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16369765.
The product of its (nonzero) digits is 40320, while the sum is 35.
Adding to 104403101542370 its reverse (73245101304401), we get a palindrome (177648202846771).
The spelling of 104403101542370 in words is "one hundred four trillion, four hundred three billion, one hundred one million, five hundred forty-two thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •