Base | Representation |
---|---|
bin | 100001101010000011… |
… | …1100001110111011101 |
3 | 20220120012020000112111 |
4 | 1003110013201313131 |
5 | 2141011211022003 |
6 | 53112033034021 |
7 | 5136056510131 |
oct | 1032407416735 |
9 | 226505200474 |
10 | 72278220253 |
11 | 28720197728 |
12 | 120119b5911 |
13 | 6a7b435285 |
14 | 36d94153c1 |
15 | 1d3062de6d |
hex | 10d41e1ddd |
72278220253 has 2 divisors, whose sum is σ = 72278220254. Its totient is φ = 72278220252.
The previous prime is 72278220143. The next prime is 72278220257. The reversal of 72278220253 is 35202287227.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72276020964 + 2199289 = 268842^2 + 1483^2 .
It is an emirp because it is prime and its reverse (35202287227) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-72278220253 is a prime.
It is a super-2 number, since 2×722782202532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (72278220257) 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 as a sum of consecutive naturals, namely, 36139110126 + 36139110127.
It is an arithmetic number, because the mean of its divisors is an integer number (36139110127).
Almost surely, 272278220253 is an apocalyptic number.
It is an amenable number.
72278220253 is a deficient number, since it is larger than the sum of its proper divisors (1).
72278220253 is an equidigital number, since it uses as much as digits as its factorization.
72278220253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 188160, while the sum is 40.
The spelling of 72278220253 in words is "seventy-two billion, two hundred seventy-eight million, two hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •