Base | Representation |
---|---|
bin | 110010111101100001… |
… | …1100011011010011101 |
3 | 101110110222020120020101 |
4 | 1211323003203122131 |
5 | 3243112302231303 |
6 | 122135255221101 |
7 | 10622664461461 |
oct | 1457303433235 |
9 | 343428216211 |
10 | 109438711453 |
11 | 4245a332785 |
12 | 19262977791 |
13 | a4211364c6 |
14 | 54228364a1 |
15 | 2ca7bc4d1d |
hex | 197b0e369d |
109438711453 has 2 divisors, whose sum is σ = 109438711454. Its totient is φ = 109438711452.
The previous prime is 109438711433. The next prime is 109438711507. The reversal of 109438711453 is 354117834901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101446709049 + 7992002404 = 318507^2 + 89398^2 .
It is a cyclic number.
It is not a de Polignac number, because 109438711453 - 213 = 109438703261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109438711423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54719355726 + 54719355727.
It is an arithmetic number, because the mean of its divisors is an integer number (54719355727).
Almost surely, 2109438711453 is an apocalyptic number.
It is an amenable number.
109438711453 is a deficient number, since it is larger than the sum of its proper divisors (1).
109438711453 is an equidigital number, since it uses as much as digits as its factorization.
109438711453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 109438711453 in words is "one hundred nine billion, four hundred thirty-eight million, seven hundred eleven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •