Base | Representation |
---|---|
bin | 1110100010100… |
… | …00110010000110 |
3 | 22111111111111020 |
4 | 13101100302012 |
5 | 222210400302 |
6 | 20034052010 |
7 | 3010456065 |
oct | 721206206 |
9 | 274444436 |
10 | 121965702 |
11 | 62934701 |
12 | 34a1a006 |
13 | 1c364871 |
14 | 122ac1dc |
15 | aa92ebc |
hex | 7450c86 |
121965702 has 8 divisors (see below), whose sum is σ = 243931416. Its totient is φ = 40655232.
The previous prime is 121965647. The next prime is 121965703. The reversal of 121965702 is 207569121.
It is a sphenic number, since it is the product of 3 distinct primes.
121965702 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121965703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10163803 + ... + 10163814.
It is an arithmetic number, because the mean of its divisors is an integer number (30491427).
Almost surely, 2121965702 is an apocalyptic number.
121965702 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121965702 is a wasteful number, since it uses less digits than its factorization.
121965702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20327622.
The product of its (nonzero) digits is 7560, while the sum is 33.
The square root of 121965702 is about 11043.8083105422. The cubic root of 121965702 is about 495.9210847178.
The spelling of 121965702 in words is "one hundred twenty-one million, nine hundred sixty-five thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •