Base | Representation |
---|---|
bin | 110010110011011001… |
… | …0101101001010001001 |
3 | 101102121021112202121201 |
4 | 1211212302231022021 |
5 | 3241413240004401 |
6 | 122041432504201 |
7 | 10611366036121 |
oct | 1454662551211 |
9 | 342537482551 |
10 | 109098750601 |
11 | 422a54450a5 |
12 | 19188b4b061 |
13 | a398886939 |
14 | 53cd61dc81 |
15 | 2c87e20b01 |
hex | 1966cad289 |
109098750601 has 9 divisors (see below), whose sum is σ = 109479590101. Its totient is φ = 108719234752.
The previous prime is 109098750599. The next prime is 109098750667. The reversal of 109098750601 is 106057890901.
It is a happy number.
The square root of 109098750601 is 330301.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 14173140601 + 94925610000 = 119051^2 + 308100^2 .
It is not a de Polignac number, because 109098750601 - 21 = 109098750599 is a prime.
It is a super-2 number, since 2×1090987506012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109098790601) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 183977361 + ... + 183977953.
Almost surely, 2109098750601 is an apocalyptic number.
109098750601 is the 330301-st square number.
109098750601 is the 165151-st centered octagonal number.
It is an amenable number.
109098750601 is a deficient number, since it is larger than the sum of its proper divisors (380839500).
109098750601 is an frugal number, since it uses more digits than its factorization.
109098750601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2300 (or 1150 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 46.
The spelling of 109098750601 in words is "one hundred nine billion, ninety-eight million, seven hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •