Base | Representation |
---|---|
bin | 1110101100010010000… |
… | …1101000010110100111 |
3 | 220010111120000101200211 |
4 | 3223010201220112213 |
5 | 13113411221103133 |
6 | 311541532320251 |
7 | 24143560153522 |
oct | 3530441502647 |
9 | 803446011624 |
10 | 252405253543 |
11 | 980542048a3 |
12 | 40b02013087 |
13 | 1aa56496b41 |
14 | c30603bbb9 |
15 | 687407bbcd |
hex | 3ac48685a7 |
252405253543 has 8 divisors (see below), whose sum is σ = 260553641600. Its totient is φ = 244257258240.
The previous prime is 252405253517. The next prime is 252405253571. The reversal of 252405253543 is 345352504252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 252405253543 - 217 = 252405122471 is a prime.
It is a super-2 number, since 2×2524052535432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 252405253496 and 252405253505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252405653543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1775983 + ... + 1912831.
It is an arithmetic number, because the mean of its divisors is an integer number (32569205200).
Almost surely, 2252405253543 is an apocalyptic number.
252405253543 is a deficient number, since it is larger than the sum of its proper divisors (8148388057).
252405253543 is a wasteful number, since it uses less digits than its factorization.
252405253543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196377.
The product of its (nonzero) digits is 720000, while the sum is 40.
Adding to 252405253543 its reverse (345352504252), we get a palindrome (597757757795).
The spelling of 252405253543 in words is "two hundred fifty-two billion, four hundred five million, two hundred fifty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •