Base | Representation |
---|---|
bin | 100110100101001011100… |
… | …0100010100011100111111 |
3 | 200202220202000122111202100 |
4 | 1031022113010110130333 |
5 | 1143334032134311411 |
6 | 15135540154400143 |
7 | 1055044330324401 |
oct | 115122704243477 |
9 | 20686660574670 |
10 | 5302524135231 |
11 | 1764873701a34 |
12 | 7177b8730053 |
13 | 2c6044b229cb |
14 | 144901c1cb71 |
15 | 92de67c7456 |
hex | 4d29711473f |
5302524135231 has 24 divisors (see below), whose sum is σ = 7674360145920. Its totient is φ = 3528020620800.
The previous prime is 5302524135169. The next prime is 5302524135281. The reversal of 5302524135231 is 1325314252035.
5302524135231 is a `hidden beast` number, since 5 + 3 + 0 + 2 + 5 + 2 + 413 + 5 + 231 = 666.
It is not a de Polignac number, because 5302524135231 - 237 = 5165085181759 is a prime.
It is a super-2 number, since 2×53025241352312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302524135281) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 146424055 + ... + 146460263.
It is an arithmetic number, because the mean of its divisors is an integer number (319765006080).
Almost surely, 25302524135231 is an apocalyptic number.
5302524135231 is a deficient number, since it is larger than the sum of its proper divisors (2371836010689).
5302524135231 is a wasteful number, since it uses less digits than its factorization.
5302524135231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67967 (or 67964 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 5302524135231 its reverse (1325314252035), we get a palindrome (6627838387266).
The spelling of 5302524135231 in words is "five trillion, three hundred two billion, five hundred twenty-four million, one hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •