Base | Representation |
---|---|
bin | 100111101000011011100… |
… | …101110010011001010001 |
3 | 100122100202110100022220001 |
4 | 213220123211302121101 |
5 | 324110132332444431 |
6 | 5443051300050001 |
7 | 400523115240004 |
oct | 47503345623121 |
9 | 10570673308801 |
10 | 2723472156241 |
11 | 960022038911 |
12 | 37b9b1393901 |
13 | 169a8c846b55 |
14 | 95b6126b53b |
15 | 4ac9ca5ce61 |
hex | 27a1b972651 |
2723472156241 has 2 divisors, whose sum is σ = 2723472156242. Its totient is φ = 2723472156240.
The previous prime is 2723472156199. The next prime is 2723472156319. The reversal of 2723472156241 is 1426512743272.
2723472156241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1404511784641 + 1318960371600 = 1185121^2 + 1148460^2 .
It is a cyclic number.
It is not a de Polignac number, because 2723472156241 - 225 = 2723438601809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2723472156191 and 2723472156200.
It is not a weakly prime, because it can be changed into another prime (2723472156341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1361736078120 + 1361736078121.
It is an arithmetic number, because the mean of its divisors is an integer number (1361736078121).
Almost surely, 22723472156241 is an apocalyptic number.
It is an amenable number.
2723472156241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2723472156241 is an equidigital number, since it uses as much as digits as its factorization.
2723472156241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1128960, while the sum is 46.
The spelling of 2723472156241 in words is "two trillion, seven hundred twenty-three billion, four hundred seventy-two million, one hundred fifty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •