Base | Representation |
---|---|
bin | 10111101111001111000011… |
… | …100001000110111010001001 |
3 | 111200122122100200220101000012 |
4 | 113233033003201012322021 |
5 | 102141001322334100131 |
6 | 1010013102544321305 |
7 | 30663504231354545 |
oct | 2757170341067211 |
9 | 450578320811005 |
10 | 104401050300041 |
11 | 302a126718a100 |
12 | b861758613235 |
13 | 4633c9104ba11 |
14 | 1bad0759d6a25 |
15 | c10a9e48d52b |
hex | 5ef3c3846e89 |
104401050300041 has 12 divisors (see below), whose sum is σ = 116207466816000. Its totient is φ = 93708652734840.
The previous prime is 104401050299993. The next prime is 104401050300059. The reversal of 104401050300041 is 140003050104401.
It is not a de Polignac number, because 104401050300041 - 214 = 104401050283657 is a prime.
It is a super-2 number, since 2×1044010503000412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104401050300641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5460867641 + ... + 5460886758.
It is an arithmetic number, because the mean of its divisors is an integer number (9683955568000).
Almost surely, 2104401050300041 is an apocalyptic number.
104401050300041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104401050300041 is a deficient number, since it is larger than the sum of its proper divisors (11806416515959).
104401050300041 is a wasteful number, since it uses less digits than its factorization.
104401050300041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10921754500 (or 10921754489 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
The spelling of 104401050300041 in words is "one hundred four trillion, four hundred one billion, fifty million, three hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •