Base | Representation |
---|---|
bin | 1101001110000… |
… | …11101011001001 |
3 | 21201200101220001 |
4 | 12213003223021 |
5 | 211342330321 |
6 | 15001003001 |
7 | 2514436222 |
oct | 647035311 |
9 | 251611801 |
10 | 110901961 |
11 | 57668315 |
12 | 31183461 |
13 | 19c8ca81 |
14 | 10a2c249 |
15 | 9b09c91 |
hex | 69c3ac9 |
110901961 has 3 divisors (see below), whose sum is σ = 110912493. Its totient is φ = 110891430.
The previous prime is 110901937. The next prime is 110901971. The reversal of 110901961 is 169109011.
The square root of 110901961 is 10531.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 110901961 - 29 = 110901449 is a prime.
It is a super-3 number, since 3×1109019613 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110901971) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5266 + ... + 15796.
It is an arithmetic number, because the mean of its divisors is an integer number (36970831).
Almost surely, 2110901961 is an apocalyptic number.
110901961 is the 10531-st square number.
110901961 is the 5266-th centered octagonal number.
It is an amenable number.
110901961 is a deficient number, since it is larger than the sum of its proper divisors (10532).
110901961 is an frugal number, since it uses more digits than its factorization.
110901961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21062 (or 10531 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 28.
The cubic root of 110901961 is about 480.4480206448.
The spelling of 110901961 in words is "one hundred ten million, nine hundred one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •