Base | Representation |
---|---|
bin | 1001001000111111101110… |
… | …1001110111001101100010 |
3 | 1022120210012021100200210010 |
4 | 2102033323221313031202 |
5 | 2304130202020414420 |
6 | 33212550405345350 |
7 | 2055046046153256 |
oct | 222177351671542 |
9 | 38523167320703 |
10 | 10050150560610 |
11 | 3225276a91526 |
12 | 1163953108256 |
13 | 57b957162364 |
14 | 26a603852266 |
15 | 126662b284e0 |
hex | 923fba77362 |
10050150560610 has 16 divisors (see below), whose sum is σ = 24120361345536. Its totient is φ = 2680040149488.
The previous prime is 10050150560603. The next prime is 10050150560627. The reversal of 10050150560610 is 1606505105001.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 335005018687 = 10050150560610 / (1 + 0 + 0 + 5 + 0 + 1 + 5 + 0 + 5 + 6 + 0 + 6 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167502509314 + ... + 167502509373.
It is an arithmetic number, because the mean of its divisors is an integer number (1507522584096).
Almost surely, 210050150560610 is an apocalyptic number.
10050150560610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10050150560610 is an abundant number, since it is smaller than the sum of its proper divisors (14070210784926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10050150560610 is a wasteful number, since it uses less digits than its factorization.
10050150560610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335005018697.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 10050150560610 its reverse (1606505105001), we get a palindrome (11656655665611).
The spelling of 10050150560610 in words is "ten trillion, fifty billion, one hundred fifty million, five hundred sixty thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •