Base | Representation |
---|---|
bin | 111001010011001010001111… |
… | …100110110010011000011111 |
3 | 1020001021110210001222021202001 |
4 | 321103022033212302120133 |
5 | 231012323344012411411 |
6 | 2251545351311143131 |
7 | 104036532523351666 |
oct | 7123121746623037 |
9 | 1201243701867661 |
10 | 252005320435231 |
11 | 73329946690a30 |
12 | 2432039bb14aa7 |
13 | aa7cccc5a913c |
14 | 46331a0551ddd |
15 | 1e20383d2bdc1 |
hex | e5328f9b261f |
252005320435231 has 32 divisors (see below), whose sum is σ = 291272434818048. Its totient is φ = 215481732963840.
The previous prime is 252005320435229. The next prime is 252005320435291. The reversal of 252005320435231 is 132534023500252.
It is a cyclic number.
It is not a de Polignac number, because 252005320435231 - 21 = 252005320435229 is a prime.
It is a super-2 number, since 2×2520053204352312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252005320435291) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2076501205 + ... + 2076622561.
It is an arithmetic number, because the mean of its divisors is an integer number (9102263588064).
Almost surely, 2252005320435231 is an apocalyptic number.
252005320435231 is a deficient number, since it is larger than the sum of its proper divisors (39267114382817).
252005320435231 is a wasteful number, since it uses less digits than its factorization.
252005320435231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128391.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 252005320435231 its reverse (132534023500252), we get a palindrome (384539343935483).
The spelling of 252005320435231 in words is "two hundred fifty-two trillion, five billion, three hundred twenty million, four hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •