Base | Representation |
---|---|
bin | 111001010100000111000000… |
… | …010001011010101100000111 |
3 | 1020001111201011211102000111021 |
4 | 321110013000101122230013 |
5 | 231014411002211114213 |
6 | 2252035341200052011 |
7 | 104044332332544463 |
oct | 7124070021325407 |
9 | 1201451154360437 |
10 | 252070561426183 |
11 | 73354585506075 |
12 | 24330b69004007 |
13 | aa861c8aa1ab6 |
14 | 46363cd0b94a3 |
15 | 1e21e0173ad8d |
hex | e541c045ab07 |
252070561426183 has 2 divisors, whose sum is σ = 252070561426184. Its totient is φ = 252070561426182.
The previous prime is 252070561426163. The next prime is 252070561426207. The reversal of 252070561426183 is 381624165070252.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 252070561426183 - 237 = 251933122472711 is a prime.
It is a super-4 number, since 4×2520705614261834 (a number of 59 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 252070561426183.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (252070561426163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126035280713091 + 126035280713092.
It is an arithmetic number, because the mean of its divisors is an integer number (126035280713092).
Almost surely, 2252070561426183 is an apocalyptic number.
252070561426183 is a deficient number, since it is larger than the sum of its proper divisors (1).
252070561426183 is an equidigital number, since it uses as much as digits as its factorization.
252070561426183 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4838400, while the sum is 52.
The spelling of 252070561426183 in words is "two hundred fifty-two trillion, seventy billion, five hundred sixty-one million, four hundred twenty-six thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •