Base | Representation |
---|---|
bin | 111001111111011110010101… |
… | …1000011011000001111000100 |
3 | 2110220010012002221020001211202 |
4 | 1303332330223003120033010 |
5 | 1013324444024401300040 |
6 | 5004521113422122032 |
7 | 212305405602163424 |
oct | 16376745303301704 |
9 | 2426105087201752 |
10 | 510101103150020 |
11 | 138596732468918 |
12 | 49265017420318 |
13 | 18b82434a43325 |
14 | 8dd704cd28484 |
15 | 3de8d78835015 |
hex | 1cfef2b0d83c4 |
510101103150020 has 24 divisors (see below), whose sum is σ = 1127591912227200. Its totient is φ = 193301470667232.
The previous prime is 510101103150011. The next prime is 510101103150071. The reversal of 510101103150020 is 20051301101015.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 510101103149974 and 510101103150001.
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, 671185661660 + ... + 671185662419.
It is an arithmetic number, because the mean of its divisors is an integer number (46982996342800).
Almost surely, 2510101103150020 is an apocalyptic number.
It is an amenable number.
510101103150020 is an abundant number, since it is smaller than the sum of its proper divisors (617490809077180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
510101103150020 is a wasteful number, since it uses less digits than its factorization.
510101103150020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1342371324107 (or 1342371324105 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 510101103150020 its reverse (20051301101015), we get a palindrome (530152404251035).
The spelling of 510101103150020 in words is "five hundred ten trillion, one hundred one billion, one hundred three million, one hundred fifty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •