Base | Representation |
---|---|
bin | 111001010101000001110001… |
… | …000100000110001001010101 |
3 | 1020001201202001001221110221020 |
4 | 321111001301010012021111 |
5 | 231021424212200343131 |
6 | 2252124334130111353 |
7 | 104052025031464620 |
oct | 7125016104061125 |
9 | 1201652031843836 |
10 | 252133657043541 |
11 | 73379313321289 |
12 | 2434123771b559 |
13 | aa8c142981220 |
14 | 4639496b44db7 |
15 | 1e23895b1d996 |
hex | e55071106255 |
252133657043541 has 64 divisors (see below), whose sum is σ = 417878947799040. Its totient is φ = 131669564878080.
The previous prime is 252133657043497. The next prime is 252133657043701. The reversal of 252133657043541 is 145340756331252.
It is not a de Polignac number, because 252133657043541 - 227 = 252133522825813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252133657033541) 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 63 ways as a sum of consecutive naturals, for example, 111951520 + ... + 114181478.
It is an arithmetic number, because the mean of its divisors is an integer number (6529358559360).
Almost surely, 2252133657043541 is an apocalyptic number.
252133657043541 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
252133657043541 is a deficient number, since it is larger than the sum of its proper divisors (165745290755499).
252133657043541 is a wasteful number, since it uses less digits than its factorization.
252133657043541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2234106.
The product of its (nonzero) digits is 9072000, while the sum is 51.
The spelling of 252133657043541 in words is "two hundred fifty-two trillion, one hundred thirty-three billion, six hundred fifty-seven million, forty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •