Base | Representation |
---|---|
bin | 110010111010011100… |
… | …1100001111000010001 |
3 | 101110012202212211121001 |
4 | 1211310321201320101 |
5 | 3242404331423213 |
6 | 122121125302001 |
7 | 10620301511461 |
oct | 1456471417021 |
9 | 343182784531 |
10 | 109335420433 |
11 | 42406aa36a8 |
12 | 19234264901 |
13 | a40590ca65 |
14 | 5412c29ba1 |
15 | 2c9dac01dd |
hex | 1974e61e11 |
109335420433 has 4 divisors (see below), whose sum is σ = 111398352948. Its totient is φ = 107272487920.
The previous prime is 109335420353. The next prime is 109335420473. The reversal of 109335420433 is 334024533901.
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 74339113104 + 34996307329 = 272652^2 + 187073^2 .
It is a cyclic number.
It is not a de Polignac number, because 109335420433 - 217 = 109335289361 is a prime.
It is a super-2 number, since 2×1093354204332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 109335420392 and 109335420401.
It is not an unprimeable number, because it can be changed into a prime (109335420473) 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, 1031466178 + ... + 1031466283.
It is an arithmetic number, because the mean of its divisors is an integer number (27849588237).
Almost surely, 2109335420433 is an apocalyptic number.
It is an amenable number.
109335420433 is a deficient number, since it is larger than the sum of its proper divisors (2062932515).
109335420433 is an equidigital number, since it uses as much as digits as its factorization.
109335420433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2062932514.
The product of its (nonzero) digits is 116640, while the sum is 37.
The spelling of 109335420433 in words is "one hundred nine billion, three hundred thirty-five million, four hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •