Base | Representation |
---|---|
bin | 1110011011100… |
… | …00010110100000 |
3 | 22102202210111012 |
4 | 13031300112200 |
5 | 221441441212 |
6 | 20002240052 |
7 | 2666610023 |
oct | 715602640 |
9 | 272683435 |
10 | 121046432 |
11 | 62366a81 |
12 | 34656028 |
13 | 1c102310 |
14 | 1210d1ba |
15 | a960922 |
hex | 73705a0 |
121046432 has 96 divisors (see below), whose sum is σ = 270273024. Its totient is φ = 52992000.
The previous prime is 121046417. The next prime is 121046437. The reversal of 121046432 is 234640121.
It is a junction number, because it is equal to n+sod(n) for n = 121046398 and 121046407.
It is not an unprimeable number, because it can be changed into a prime (121046437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 801557 + ... + 801707.
It is an arithmetic number, because the mean of its divisors is an integer number (2815344).
Almost surely, 2121046432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121046432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135136512).
121046432 is an abundant number, since it is smaller than the sum of its proper divisors (149226592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121046432 is a wasteful number, since it uses less digits than its factorization.
121046432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262 (or 254 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 121046432 is about 11002.1103430206. The cubic root of 121046432 is about 494.6720025515.
Adding to 121046432 its reverse (234640121), we get a palindrome (355686553).
The spelling of 121046432 in words is "one hundred twenty-one million, forty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •