Base | Representation |
---|---|
bin | 1000100010001000010… |
… | …0100010111011011010 |
3 | 112000101211201021111012 |
4 | 2020202010202323122 |
5 | 4400214212130200 |
6 | 151203005333522 |
7 | 13406616506156 |
oct | 2104204427332 |
9 | 460354637435 |
10 | 146600505050 |
11 | 5719a18829a |
12 | 244b42672a2 |
13 | 10a941a249c |
14 | 714a0b6066 |
15 | 3c30426a35 |
hex | 2222122eda |
146600505050 has 24 divisors (see below), whose sum is σ = 281472972672. Its totient is φ = 56748582000.
The previous prime is 146600505031. The next prime is 146600505059. The reversal of 146600505050 is 50505006641.
146600505050 is a modest number, since divided by 505050 gives 146600 as remainder.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 146600504998 and 146600505016.
It is not an unprimeable number, because it can be changed into a prime (146600505059) 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, 47288936 + ... + 47292035.
It is an arithmetic number, because the mean of its divisors is an integer number (11728040528).
Almost surely, 2146600505050 is an apocalyptic number.
146600505050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146600505050 is a deficient number, since it is larger than the sum of its proper divisors (134872467622).
146600505050 is a wasteful number, since it uses less digits than its factorization.
146600505050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94581014 (or 94581009 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 146600505050 in words is "one hundred forty-six billion, six hundred million, five hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •