Base | Representation |
---|---|
bin | 1110101101001101101… |
… | …11001000000011100001 |
3 | 1210022021222010022001211 |
4 | 13112212313020003201 |
5 | 31234334011024101 |
6 | 1024045252430121 |
7 | 51336032406655 |
oct | 7264667100341 |
9 | 1708258108054 |
10 | 505310642401 |
11 | 185334758764 |
12 | 81b23618341 |
13 | 3885c462526 |
14 | 1a658668a65 |
15 | d226e9bc51 |
hex | 75a6dc80e1 |
505310642401 has 16 divisors (see below), whose sum is σ = 513631407744. Its totient is φ = 497063384064.
The previous prime is 505310642387. The next prime is 505310642489. The reversal of 505310642401 is 104246013505.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 505310642401 - 27 = 505310642273 is a prime.
It is a super-2 number, since 2×5053106424012 (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 (505310642491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13439310 + ... + 13476856.
It is an arithmetic number, because the mean of its divisors is an integer number (32101962984).
Almost surely, 2505310642401 is an apocalyptic number.
It is an amenable number.
505310642401 is a deficient number, since it is larger than the sum of its proper divisors (8320765343).
505310642401 is a wasteful number, since it uses less digits than its factorization.
505310642401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38520.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 505310642401 its reverse (104246013505), we get a palindrome (609556655906).
The spelling of 505310642401 in words is "five hundred five billion, three hundred ten million, six hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •