Base | Representation |
---|---|
bin | 1110101100111010111… |
… | …00111000110000111001 |
3 | 1210021212222001111120211 |
4 | 13112131130320300321 |
5 | 31234023102102311 |
6 | 1024021452551121 |
7 | 51332104455622 |
oct | 7263534706071 |
9 | 1707788044524 |
10 | 505152769081 |
11 | 185263629144 |
12 | 81a9a7824a1 |
13 | 38835837a6c |
14 | 1a6416d0a49 |
15 | d2181b4821 |
hex | 759d738c39 |
505152769081 has 9 divisors (see below), whose sum is σ = 506619000741. Its totient is φ = 503690774844.
The previous prime is 505152769061. The next prime is 505152769117. The reversal of 505152769081 is 180967251505.
The square root of 505152769081 is 710741.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 505152769081 - 221 = 505150671929 is a prime.
It is a super-2 number, since 2×5051527690812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505152769061) 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, 312014490 + ... + 312016108.
Almost surely, 2505152769081 is an apocalyptic number.
505152769081 is the 710741-st square number.
505152769081 is the 355371-st centered octagonal number.
It is an amenable number.
505152769081 is a deficient number, since it is larger than the sum of its proper divisors (1466231660).
505152769081 is an frugal number, since it uses more digits than its factorization.
505152769081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4116 (or 2058 counting only the distinct ones).
The product of its (nonzero) digits is 756000, while the sum is 49.
Multiplying 505152769081 by its sum of digits (49), we get a square (24752485684969 = 49751872).
The spelling of 505152769081 in words is "five hundred five billion, one hundred fifty-two million, seven hundred sixty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •