Base | Representation |
---|---|
bin | 100100011111110010011… |
… | …1100101110000011100100 |
3 | 122202112100101210220122101 |
4 | 1020333210330232003210 |
5 | 1124140401344110324 |
6 | 14400203320341444 |
7 | 1025253561066541 |
oct | 110774474560344 |
9 | 18675311726571 |
10 | 5016067956964 |
11 | 1664336658439 |
12 | 690193014884 |
13 | 2a5022c520cc |
14 | 134ac9767bc8 |
15 | 8a72d18c944 |
hex | 48fe4f2e0e4 |
5016067956964 has 27 divisors (see below), whose sum is σ = 8830517002363. Its totient is φ = 2493151451072.
The previous prime is 5016067956961. The next prime is 5016067956989. The reversal of 5016067956964 is 4696597606105.
The square root of 5016067956964 is 2239658.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 94591923364 + 4921476033600 = 307558^2 + 2218440^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5016067956896 and 5016067956905.
It is not an unprimeable number, because it can be changed into a prime (5016067956961) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 774918432 + ... + 774924904.
Almost surely, 25016067956964 is an apocalyptic number.
5016067956964 is the 2239658-th square number.
It is an amenable number.
5016067956964 is a deficient number, since it is larger than the sum of its proper divisors (3814449045399).
5016067956964 is an frugal number, since it uses more digits than its factorization.
5016067956964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13296 (or 6648 counting only the distinct ones).
The product of its (nonzero) digits is 73483200, while the sum is 64.
Multiplying 5016067956964 by its sum of digits (64), we get a square (321028349245696 = 179172642).
The spelling of 5016067956964 in words is "five trillion, sixteen billion, sixty-seven million, nine hundred fifty-six thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •