Base | Representation |
---|---|
bin | 100100011111010011001… |
… | …0000001111101110101101 |
3 | 122202102122002120121021020 |
4 | 1020332212100033232231 |
5 | 1124131223111023041 |
6 | 14355511103524353 |
7 | 1025215526412360 |
oct | 110764620175655 |
9 | 18672562517236 |
10 | 5015016111021 |
11 | 1663946942a74 |
12 | 68bb3a8b96b9 |
13 | 2a4bb6061567 |
14 | 134a29ba20d7 |
15 | 8a6bab69866 |
hex | 48fa640fbad |
5015016111021 has 32 divisors (see below), whose sum is σ = 7646713804800. Its totient is φ = 2863929898560.
The previous prime is 5015016110999. The next prime is 5015016111113. The reversal of 5015016111021 is 1201116105105.
It is not a de Polignac number, because 5015016111021 - 27 = 5015016110893 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5015016110982 and 5015016111000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5015016111821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 305394391 + ... + 305410811.
It is an arithmetic number, because the mean of its divisors is an integer number (238959806400).
Almost surely, 25015016111021 is an apocalyptic number.
It is an amenable number.
5015016111021 is a deficient number, since it is larger than the sum of its proper divisors (2631697693779).
5015016111021 is a wasteful number, since it uses less digits than its factorization.
5015016111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24649.
The product of its (nonzero) digits is 300, while the sum is 24.
The spelling of 5015016111021 in words is "five trillion, fifteen billion, sixteen million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •