Base | Representation |
---|---|
bin | 1001101001010011000111… |
… | …0100100001001111011010 |
3 | 1101112211122100122112121121 |
4 | 2122110301310201033122 |
5 | 2342223231141330200 |
6 | 34315530442355454 |
7 | 2143123341356626 |
oct | 232246164411732 |
9 | 41484570575547 |
10 | 10605110105050 |
11 | 34196691a812a |
12 | 1233411abbb8a |
13 | 5bc0996b5716 |
14 | 28940bd36186 |
15 | 135ce3715e1a |
hex | 9a531d213da |
10605110105050 has 24 divisors (see below), whose sum is σ = 19728028933596. Its totient is φ = 4241501216640.
The previous prime is 10605110105011. The next prime is 10605110105059. The reversal of 10605110105050 is 5050101150601.
It can be written as a sum of positive squares in 6 ways, for example, as 3142362474241 + 7462747630809 = 1772671^2 + 2731803^2 .
It is a super-2 number, since 2×106051101050502 (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 (10605110105059) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13175877 + ... + 13957576.
Almost surely, 210605110105050 is an apocalyptic number.
10605110105050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10605110105050 is a deficient number, since it is larger than the sum of its proper divisors (9122918828546).
10605110105050 is a wasteful number, since it uses less digits than its factorization.
10605110105050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27141282 (or 27141277 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 10605110105050 its reverse (5050101150601), we get a palindrome (15655211255651).
The spelling of 10605110105050 in words is "ten trillion, six hundred five billion, one hundred ten million, one hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •