Base | Representation |
---|---|
bin | 10111101111010001001000… |
… | …100000000111110000101011 |
3 | 111200122212010012010120000200 |
4 | 113233101020200013300223 |
5 | 102141020410020123430 |
6 | 1010014112205003243 |
7 | 30663613432450551 |
oct | 2757211040076053 |
9 | 450585105116020 |
10 | 104403281411115 |
11 | 302a2201628955 |
12 | b86207b853523 |
13 | 4634258353c9b |
14 | 1bad208051bd1 |
15 | c10b802a3460 |
hex | 5ef448807c2b |
104403281411115 has 48 divisors (see below), whose sum is σ = 181066949843520. Its totient is φ = 55650596555520.
The previous prime is 104403281411101. The next prime is 104403281411123. The reversal of 104403281411115 is 511114182304401.
104403281411115 is a `hidden beast` number, since 10 + 4 + 40 + 3 + 2 + 81 + 411 + 115 = 666.
It is not a de Polignac number, because 104403281411115 - 210 = 104403281410091 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104403281411115.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1624188546 + ... + 1624252824.
It is an arithmetic number, because the mean of its divisors is an integer number (3772228121740).
Almost surely, 2104403281411115 is an apocalyptic number.
104403281411115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104403281411115 is a deficient number, since it is larger than the sum of its proper divisors (76663668432405).
104403281411115 is a wasteful number, since it uses less digits than its factorization.
104403281411115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83924 (or 83921 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 36.
The spelling of 104403281411115 in words is "one hundred four trillion, four hundred three billion, two hundred eighty-one million, four hundred eleven thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •