Base | Representation |
---|---|
bin | 111001011100011100001001… |
… | …1101101000100100011000111 |
3 | 2110021001212121211001020021110 |
4 | 1302320320103231010203013 |
5 | 1012212101314042244211 |
6 | 4550353112552420103 |
7 | 211300466302020630 |
oct | 16270702355044307 |
9 | 2407055554036243 |
10 | 505286053087431 |
11 | 136aaa680207800 |
12 | 488079a49a7633 |
13 | 188c3368c74465 |
14 | 8cabd9292a887 |
15 | 3d639b3184ea6 |
hex | 1cb8e13b448c7 |
505286053087431 has 96 divisors (see below), whose sum is σ = 896121310855680. Its totient is φ = 247040798146560.
The previous prime is 505286053087411. The next prime is 505286053087457. The reversal of 505286053087431 is 134780350682505.
It is not a de Polignac number, because 505286053087431 - 227 = 505285918869703 is a prime.
It is a super-2 number, since 2×5052860530874312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505286053087411) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2903572135 + ... + 2903746151.
It is an arithmetic number, because the mean of its divisors is an integer number (9334596988080).
Almost surely, 2505286053087431 is an apocalyptic number.
505286053087431 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
505286053087431 is a deficient number, since it is larger than the sum of its proper divisors (390835257768249).
505286053087431 is a wasteful number, since it uses less digits than its factorization.
505286053087431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241285 (or 241274 counting only the distinct ones).
The product of its (nonzero) digits is 24192000, while the sum is 57.
The spelling of 505286053087431 in words is "five hundred five trillion, two hundred eighty-six billion, fifty-three million, eighty-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •