Base | Representation |
---|---|
bin | 10111101111010100010110… |
… | …010001100100100011101000 |
3 | 111200200012000210020011201220 |
4 | 113233110112101210203220 |
5 | 102141044442312002100 |
6 | 1010015442531342040 |
7 | 30664065122450622 |
oct | 2757242621444350 |
9 | 450605023204656 |
10 | 104406733703400 |
11 | 302a3713330177 |
12 | b862883a51920 |
13 | 463468865869b |
14 | 1bad454751c12 |
15 | c10cd33d9aa0 |
hex | 5ef5164648e8 |
104406733703400 has 96 divisors (see below), whose sum is σ = 325989370240800. Its totient is φ = 27641494944000.
The previous prime is 104406733703399. The next prime is 104406733703479. The reversal of 104406733703400 is 4307337604401.
It is a super-2 number, since 2×1044067337034002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 625856251 + ... + 626023050.
It is an arithmetic number, because the mean of its divisors is an integer number (3395722606675).
Almost surely, 2104406733703400 is an apocalyptic number.
104406733703400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104406733703400 is an abundant number, since it is smaller than the sum of its proper divisors (221582636537400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104406733703400 is a wasteful number, since it uses less digits than its factorization.
104406733703400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251879459 (or 1251879450 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 42.
The spelling of 104406733703400 in words is "one hundred four trillion, four hundred six billion, seven hundred thirty-three million, seven hundred three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •