Base | Representation |
---|---|
bin | 110001010111000101… |
… | …1110111000111110010 |
3 | 101010121102122011220120 |
4 | 1202232023313013302 |
5 | 3214042344410200 |
6 | 120410233151110 |
7 | 10441550252061 |
oct | 1425613670762 |
9 | 333542564816 |
10 | 106001560050 |
11 | 40a56131a91 |
12 | 1866385b496 |
13 | 9cc40035c9 |
14 | 51b81581d8 |
15 | 2b5607e9a0 |
hex | 18ae2f71f2 |
106001560050 has 48 divisors (see below), whose sum is σ = 262904110560. Its totient is φ = 28264906240.
The previous prime is 106001560009. The next prime is 106001560051. The reversal of 106001560050 is 50065100601.
It is a super-2 number, since 2×1060015600502 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106001560050.
It is not an unprimeable number, because it can be changed into a prime (106001560051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3196354 + ... + 3229346.
It is an arithmetic number, because the mean of its divisors is an integer number (5477168970).
Almost surely, 2106001560050 is an apocalyptic number.
106001560050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106001560050 is an abundant number, since it is smaller than the sum of its proper divisors (156902550510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106001560050 is a wasteful number, since it uses less digits than its factorization.
106001560050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54427 (or 54422 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 106001560050 its reverse (50065100601), we get a palindrome (156066660651).
The spelling of 106001560050 in words is "one hundred six billion, one million, five hundred sixty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •