Base | Representation |
---|---|
bin | 110010101111010001… |
… | …1000111111111000101 |
3 | 101102020122022021201221 |
4 | 1211132203013333011 |
5 | 3241122333322303 |
6 | 122020012320341 |
7 | 10605066346633 |
oct | 1453643077705 |
9 | 342218267657 |
10 | 108960448453 |
11 | 422343726aa |
12 | 1914a7730b1 |
13 | a37602234c |
14 | 53b90dc353 |
15 | 2c7ac024bd |
hex | 195e8c7fc5 |
108960448453 has 4 divisors (see below), whose sum is σ = 109151943660. Its totient is φ = 108768953248.
The previous prime is 108960448451. The next prime is 108960448463. The reversal of 108960448453 is 354844069801.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66655363329 + 42305085124 = 258177^2 + 205682^2 .
It is a cyclic number.
It is not a de Polignac number, because 108960448453 - 21 = 108960448451 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 108960448453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108960448451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95746750 + ... + 95747887.
It is an arithmetic number, because the mean of its divisors is an integer number (27287985915).
Almost surely, 2108960448453 is an apocalyptic number.
It is an amenable number.
108960448453 is a deficient number, since it is larger than the sum of its proper divisors (191495207).
108960448453 is an equidigital number, since it uses as much as digits as its factorization.
108960448453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191495206.
The product of its (nonzero) digits is 3317760, while the sum is 52.
The spelling of 108960448453 in words is "one hundred eight billion, nine hundred sixty million, four hundred forty-eight thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •