Base | Representation |
---|---|
bin | 1110101101000010000… |
… | …01010001111100010000 |
3 | 1210022001010201022110210 |
4 | 13112201001101330100 |
5 | 31234133414003130 |
6 | 1024031432124120 |
7 | 51333432410502 |
oct | 7264101217420 |
9 | 1708033638423 |
10 | 505212641040 |
11 | 1852944018a8 |
12 | 81ab6836640 |
13 | 3884506b663 |
14 | 1a649637d72 |
15 | d21d58e5b0 |
hex | 75a1051f10 |
505212641040 has 80 divisors (see below), whose sum is σ = 1566363728448. Its totient is φ = 134705776128.
The previous prime is 505212640997. The next prime is 505212641047. The reversal of 505212641040 is 40146212505.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×5052126410402 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 505212640989 and 505212641007.
It is not an unprimeable number, because it can be changed into a prime (505212641047) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1758402 + ... + 2025438.
Almost surely, 2505212641040 is an apocalyptic number.
It is an amenable number.
505212641040 is an abundant number, since it is smaller than the sum of its proper divisors (1061151087408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505212641040 is a wasteful number, since it uses less digits than its factorization.
505212641040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274936 (or 274930 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 505212641040 its reverse (40146212505), we get a palindrome (545358853545).
The spelling of 505212641040 in words is "five hundred five billion, two hundred twelve million, six hundred forty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •