Base | Representation |
---|---|
bin | 10100011011000000… |
… | …01001011110001101 |
3 | 1001022002121100011222 |
4 | 22031200021132031 |
5 | 134423232340303 |
6 | 5011535253125 |
7 | 535461014132 |
oct | 121540113615 |
9 | 31262540158 |
10 | 10963949453 |
11 | 4716955556 |
12 | 215b97a1a5 |
13 | 1059614672 |
14 | 7601a8589 |
15 | 44281c938 |
hex | 28d80978d |
10963949453 has 2 divisors, whose sum is σ = 10963949454. Its totient is φ = 10963949452.
The previous prime is 10963949431. The next prime is 10963949531. The reversal of 10963949453 is 35494936901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6711214084 + 4252735369 = 81922^2 + 65213^2 .
It is an emirp because it is prime and its reverse (35494936901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10963949453 - 28 = 10963949197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10963949395 and 10963949404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10963943453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5481974726 + 5481974727.
It is an arithmetic number, because the mean of its divisors is an integer number (5481974727).
Almost surely, 210963949453 is an apocalyptic number.
It is an amenable number.
10963949453 is a deficient number, since it is larger than the sum of its proper divisors (1).
10963949453 is an equidigital number, since it uses as much as digits as its factorization.
10963949453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3149280, while the sum is 53.
The spelling of 10963949453 in words is "ten billion, nine hundred sixty-three million, nine hundred forty-nine thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •