Base | Representation |
---|---|
bin | 10111110100011101011001… |
… | …010101000011000010101000 |
3 | 111201220221222201122210200020 |
4 | 113310131121111003002220 |
5 | 102212342033234201230 |
6 | 1010450033432240440 |
7 | 31031443412462226 |
oct | 2764353125030250 |
9 | 451827881583606 |
10 | 104760046006440 |
11 | 3041a538977850 |
12 | b8bb247540120 |
13 | 465baa3526226 |
14 | 1bc25b0083b16 |
15 | c1a0b1121810 |
hex | 5f47595430a8 |
104760046006440 has 128 divisors (see below), whose sum is σ = 342894586176000. Its totient is φ = 25393150603520.
The previous prime is 104760046006391. The next prime is 104760046006477. The reversal of 104760046006440 is 44600640067401.
It is a super-3 number, since 3×1047600460064403 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104760046006392 and 104760046006401.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5371711 + ... + 15439409.
It is an arithmetic number, because the mean of its divisors is an integer number (2678863954500).
Almost surely, 2104760046006440 is an apocalyptic number.
104760046006440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104760046006440 is an abundant number, since it is smaller than the sum of its proper divisors (238134540169560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104760046006440 is a wasteful number, since it uses less digits than its factorization.
104760046006440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10075607 (or 10075603 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 42.
The spelling of 104760046006440 in words is "one hundred four trillion, seven hundred sixty billion, forty-six million, six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •