Base | Representation |
---|---|
bin | 1010000110011011001101… |
… | …1010110001101011011010 |
3 | 1110022200020102122111122221 |
4 | 2201212303122301223122 |
5 | 2423423031123213200 |
6 | 35341444015334254 |
7 | 2224226441405512 |
oct | 241466332615332 |
9 | 43280212574587 |
10 | 11105500601050 |
11 | 35a18a8629a99 |
12 | 12b43a182138a |
13 | 6273236c7bcb |
14 | 2a571ad68842 |
15 | 143d2d78191a |
hex | a19b36b1ada |
11105500601050 has 24 divisors (see below), whose sum is σ = 20667063089376. Its totient is φ = 4439870784240.
The previous prime is 11105500601009. The next prime is 11105500601051. The reversal of 11105500601050 is 5010600550111.
It is a super-2 number, since 2×111055006010502 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (11105500601051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 58140102 + ... + 58330801.
It is an arithmetic number, because the mean of its divisors is an integer number (861127628724).
Almost surely, 211105500601050 is an apocalyptic number.
11105500601050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11105500601050 is a deficient number, since it is larger than the sum of its proper divisors (9561562488326).
11105500601050 is a wasteful number, since it uses less digits than its factorization.
11105500601050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116472822 (or 116472817 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 11105500601050 in words is "eleven trillion, one hundred five billion, five hundred million, six hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •