Base | Representation |
---|---|
bin | 101010110110111110010… |
… | …011000101100110100001 |
3 | 101102120012012120220212001 |
4 | 222312332103011212201 |
5 | 341223330242204411 |
6 | 10133005455404001 |
7 | 422533631516011 |
oct | 52667623054641 |
9 | 11376165526761 |
10 | 2945245272481 |
11 | a360871a0556 |
12 | 3b6984823601 |
13 | 1849739aa255 |
14 | a279cd0dc41 |
15 | 5192c745dc1 |
hex | 2adbe4c59a1 |
2945245272481 has 2 divisors, whose sum is σ = 2945245272482. Its totient is φ = 2945245272480.
The previous prime is 2945245272443. The next prime is 2945245272493. The reversal of 2945245272481 is 1842725425492.
2945245272481 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2890952078400 + 54293194081 = 1700280^2 + 233009^2 .
It is a cyclic number.
It is not a de Polignac number, because 2945245272481 - 27 = 2945245272353 is a prime.
It is a super-2 number, since 2×29452452724812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2945245972481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1472622636240 + 1472622636241.
It is an arithmetic number, because the mean of its divisors is an integer number (1472622636241).
Almost surely, 22945245272481 is an apocalyptic number.
It is an amenable number.
2945245272481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2945245272481 is an equidigital number, since it uses as much as digits as its factorization.
2945245272481 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12902400, while the sum is 55.
The spelling of 2945245272481 in words is "two trillion, nine hundred forty-five billion, two hundred forty-five million, two hundred seventy-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •