Base | Representation |
---|---|
bin | 1110101011001010001… |
… | …0001011000011101001 |
3 | 220002201112000221102211 |
4 | 3222302202023003221 |
5 | 13112301432441201 |
6 | 311451550525121 |
7 | 24133233410122 |
oct | 3526242130351 |
9 | 802645027384 |
10 | 252103405801 |
11 | 97a09889155 |
12 | 40a38b067a1 |
13 | 1aa08aa0000 |
14 | c2b7d07049 |
15 | 6857805651 |
hex | 3ab288b0e9 |
252103405801 has 15 divisors (see below), whose sum is σ = 273203244033. Its totient is φ = 232632508680.
The previous prime is 252103405777. The next prime is 252103405817. The reversal of 252103405801 is 108504301252.
The square root of 252103405801 is 502099.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 124996895401 + 127106510400 = 353549^2 + 356520^2 .
It is not a de Polignac number, because 252103405801 - 25 = 252103405769 is a prime.
It is a super-2 number, since 2×2521034058012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (252103402801) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 84853246 + ... + 84856216.
Almost surely, 2252103405801 is an apocalyptic number.
252103405801 is the 502099-th square number.
252103405801 is the 251050-th centered octagonal number.
It is an amenable number.
252103405801 is a deficient number, since it is larger than the sum of its proper divisors (21099838232).
252103405801 is an frugal number, since it uses more digits than its factorization.
252103405801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5994 (or 2984 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 31.
The spelling of 252103405801 in words is "two hundred fifty-two billion, one hundred three million, four hundred five thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •