Base | Representation |
---|---|
bin | 1000011110011101… |
… | …0001000001000001 |
3 | 12212120020000121211 |
4 | 2013213101001001 |
5 | 14124423424343 |
6 | 1013433450121 |
7 | 110245013044 |
oct | 20747210101 |
9 | 5776200554 |
10 | 2275217473 |
11 | a68334621 |
12 | 535b70941 |
13 | 2a34a8c39 |
14 | 17825ac5b |
15 | d4b2879d |
hex | 879d1041 |
2275217473 has 2 divisors, whose sum is σ = 2275217474. Its totient is φ = 2275217472.
The previous prime is 2275217437. The next prime is 2275217489. The reversal of 2275217473 is 3747125722.
Together with previous prime (2275217437) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2264141889 + 11075584 = 47583^2 + 3328^2 .
It is a cyclic number.
It is not a de Polignac number, because 2275217473 - 29 = 2275216961 is a prime.
It is a super-3 number, since 3×22752174733 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (2275217873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1137608736 + 1137608737.
It is an arithmetic number, because the mean of its divisors is an integer number (1137608737).
Almost surely, 22275217473 is an apocalyptic number.
It is an amenable number.
2275217473 is a deficient number, since it is larger than the sum of its proper divisors (1).
2275217473 is an equidigital number, since it uses as much as digits as its factorization.
2275217473 is an evil number, because the sum of its binary digits is even.
The product of its digits is 164640, while the sum is 40.
The square root of 2275217473 is about 47699.2397528514. The cubic root of 2275217473 is about 1315.2479637646.
The spelling of 2275217473 in words is "two billion, two hundred seventy-five million, two hundred seventeen thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •