Base | Representation |
---|---|
bin | 11000000000100010101110… |
… | …101101011101011010011100 |
3 | 111211212100022000122211000121 |
4 | 120000202232231131122130 |
5 | 102314443123213014104 |
6 | 1012323321405404324 |
7 | 31145440503012331 |
oct | 3000425655353234 |
9 | 454770260584017 |
10 | 105590407157404 |
11 | 3070a705116644 |
12 | ba141658696a4 |
13 | 46bc195626590 |
14 | 1c108627c4988 |
15 | c319aeaca254 |
hex | 6008aeb5d69c |
105590407157404 has 12 divisors (see below), whose sum is σ = 198997305796744. Its totient is φ = 48734034072624.
The previous prime is 105590407157387. The next prime is 105590407157419. The reversal of 105590407157404 is 404751704095501.
It is a super-2 number, since 2×1055904071574042 (a number of 29 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (52) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (52), and also a Moran number because the ratio is a prime number: 2030584753027 = 105590407157404 / (1 + 0 + 5 + 5 + 9 + 0 + 4 + 0 + 7 + 1 + 5 + 7 + 4 + 0 + 4).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1015292376462 + ... + 1015292376565.
Almost surely, 2105590407157404 is an apocalyptic number.
It is an amenable number.
105590407157404 is a deficient number, since it is larger than the sum of its proper divisors (93406898639340).
105590407157404 is a wasteful number, since it uses less digits than its factorization.
105590407157404 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2030584753044 (or 2030584753042 counting only the distinct ones).
The product of its (nonzero) digits is 3528000, while the sum is 52.
The spelling of 105590407157404 in words is "one hundred five trillion, five hundred ninety billion, four hundred seven million, one hundred fifty-seven thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •