Base | Representation |
---|---|
bin | 110011000101010101… |
… | …0011001010100011001 |
3 | 101111011012221102212222 |
4 | 1212022222121110121 |
5 | 3244131320130321 |
6 | 122221251313425 |
7 | 10632324210050 |
oct | 1461252312431 |
9 | 344135842788 |
10 | 109700551961 |
11 | 425841133a0 |
12 | 193165ab875 |
13 | a463463410 |
14 | 5449515397 |
15 | 2cc0b973ab |
hex | 198aa99519 |
109700551961 has 32 divisors (see below), whose sum is σ = 150715665408. Its totient is φ = 77070450240.
The previous prime is 109700551903. The next prime is 109700551963. The reversal of 109700551961 is 169155007901.
It is not a de Polignac number, because 109700551961 - 234 = 92520682777 is a prime.
It is a super-2 number, since 2×1097005519612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (109700551963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1231271 + ... + 1317356.
It is an arithmetic number, because the mean of its divisors is an integer number (4709864544).
Almost surely, 2109700551961 is an apocalyptic number.
109700551961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
109700551961 is a deficient number, since it is larger than the sum of its proper divisors (41015113447).
109700551961 is a wasteful number, since it uses less digits than its factorization.
109700551961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548701.
The product of its (nonzero) digits is 85050, while the sum is 44.
Multiplying 109700551961 by its sum of digits (44), we get a palindrome (4826824286284).
The spelling of 109700551961 in words is "one hundred nine billion, seven hundred million, five hundred fifty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •