Base | Representation |
---|---|
bin | 1110011011111… |
… | …10110100011100 |
3 | 22102212210210000 |
4 | 13031332310130 |
5 | 222000340232 |
6 | 20003414300 |
7 | 3000244551 |
oct | 715766434 |
9 | 272783700 |
10 | 121105692 |
11 | 623a7554 |
12 | 34684390 |
13 | 1c123296 |
14 | 12126a28 |
15 | a97327c |
hex | 737ed1c |
121105692 has 30 divisors (see below), whose sum is σ = 316595048. Its totient is φ = 40368456.
The previous prime is 121105687. The next prime is 121105693. The reversal of 121105692 is 296501121.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121105693) 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 9 ways as a sum of consecutive naturals, for example, 186568 + ... + 187215.
Almost surely, 2121105692 is an apocalyptic number.
121105692 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121105692 is an abundant number, since it is smaller than the sum of its proper divisors (195489356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121105692 is a wasteful number, since it uses less digits than its factorization.
121105692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373799 (or 373788 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 121105692 is about 11004.8031331778. The cubic root of 121105692 is about 494.7527139500.
The spelling of 121105692 in words is "one hundred twenty-one million, one hundred five thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •