Base | Representation |
---|---|
bin | 10000000101010110001… |
… | …000001110110011101010 |
3 | 10220122211212212100121212 |
4 | 100011112020032303222 |
5 | 121102023401442300 |
6 | 2203425013233122 |
7 | 142565110351424 |
oct | 20052610166352 |
9 | 3818755770555 |
10 | 1105251593450 |
11 | 39680978a974 |
12 | 15a2566327a2 |
13 | 802bcab6914 |
14 | 3b6ccb3b814 |
15 | 1db3ba53935 |
hex | 1015620ecea |
1105251593450 has 96 divisors (see below), whose sum is σ = 2142341809920. Its totient is φ = 423891104000.
The previous prime is 1105251593449. The next prime is 1105251593471. The reversal of 1105251593450 is 543951525011.
It is a junction number, because it is equal to n+sod(n) for n = 1105251593398 and 1105251593407.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 87303221 + ... + 87315879.
It is an arithmetic number, because the mean of its divisors is an integer number (22316060520).
Almost surely, 21105251593450 is an apocalyptic number.
1105251593450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1105251593450 is a deficient number, since it is larger than the sum of its proper divisors (1037090216470).
1105251593450 is a wasteful number, since it uses less digits than its factorization.
1105251593450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13472 (or 13467 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 1105251593450 in words is "one trillion, one hundred five billion, two hundred fifty-one million, five hundred ninety-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •