Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1000010101000001010 |
3 | 101010121200010201021112 |
4 | 1202232121002220022 |
5 | 3214044240440200 |
6 | 120410435210322 |
7 | 10441621522004 |
oct | 1425631025012 |
9 | 333550121245 |
10 | 106005015050 |
11 | 40a58081860 |
12 | 18664a469a2 |
13 | 9cc494309c |
14 | 51b87b7374 |
15 | 2b56513535 |
hex | 18ae642a0a |
106005015050 has 48 divisors (see below), whose sum is σ = 215125740000. Its totient is φ = 38541556800.
The previous prime is 106005014917. The next prime is 106005015071. The reversal of 106005015050 is 50510500601.
It is a super-2 number, since 2×1060050150502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5963576 + ... + 5981324.
It is an arithmetic number, because the mean of its divisors is an integer number (4481786250).
Almost surely, 2106005015050 is an apocalyptic number.
106005015050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106005015050 is an abundant number, since it is smaller than the sum of its proper divisors (109120724950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106005015050 is a wasteful number, since it uses less digits than its factorization.
106005015050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28631 (or 28626 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
Adding to 106005015050 its reverse (50510500601), we get a palindrome (156515515651).
The spelling of 106005015050 in words is "one hundred six billion, five million, fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •