Base | Representation |
---|---|
bin | 1001110101111011101001… |
… | …1011000111100001000001 |
3 | 1102022120212021001021200121 |
4 | 2131132322123013201001 |
5 | 2404302230433230343 |
6 | 35003343251020241 |
7 | 2164605654451615 |
oct | 235367233074101 |
9 | 42276767037617 |
10 | 10822150289473 |
11 | 34a2714784076 |
12 | 12694a429a681 |
13 | 6066a8127753 |
14 | 295b1b197345 |
15 | 13b797b4daed |
hex | 9d7ba6c7841 |
10822150289473 has 2 divisors, whose sum is σ = 10822150289474. Its totient is φ = 10822150289472.
The previous prime is 10822150289311. The next prime is 10822150289477. The reversal of 10822150289473 is 37498205122801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9070836839089 + 1751313450384 = 3011783^2 + 1323372^2 .
It is a cyclic number.
It is not a de Polignac number, because 10822150289473 - 237 = 10684711336001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10822150289473.
It is not a weakly prime, because it can be changed into another prime (10822150289477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5411075144736 + 5411075144737.
It is an arithmetic number, because the mean of its divisors is an integer number (5411075144737).
Almost surely, 210822150289473 is an apocalyptic number.
It is an amenable number.
10822150289473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10822150289473 is an equidigital number, since it uses as much as digits as its factorization.
10822150289473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 52.
The spelling of 10822150289473 in words is "ten trillion, eight hundred twenty-two billion, one hundred fifty million, two hundred eighty-nine thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •