Base | Representation |
---|---|
bin | 10010111100011000… |
… | …10011111000010010 |
3 | 222020210001201010200 |
4 | 21132030103320102 |
5 | 131312034020200 |
6 | 4401103040030 |
7 | 510012305214 |
oct | 113614237022 |
9 | 28223051120 |
10 | 10170220050 |
11 | 4349907941 |
12 | 1b79ba0016 |
13 | c610489b3 |
14 | 6c69d25b4 |
15 | 3e7cd3800 |
hex | 25e313e12 |
10170220050 has 36 divisors (see below), whose sum is σ = 27323992410. Its totient is φ = 2712058560.
The previous prime is 10170220009. The next prime is 10170220091. The reversal of 10170220050 is 5002207101.
It is an interprime number because it is at equal distance from previous prime (10170220009) and next prime (10170220091).
It can be written as a sum of positive squares in 3 ways, for example, as 6494586921 + 3675633129 = 80589^2 + 60627^2 .
It is a super-4 number, since 4×101702200504 (a number of 41 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11299795 + ... + 11300694.
Almost surely, 210170220050 is an apocalyptic number.
10170220050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10170220050 is an abundant number, since it is smaller than the sum of its proper divisors (17153772360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10170220050 is a wasteful number, since it uses less digits than its factorization.
10170220050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22600507 (or 22600499 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
Adding to 10170220050 its reverse (5002207101), we get a palindrome (15172427151).
The spelling of 10170220050 in words is "ten billion, one hundred seventy million, two hundred twenty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •