Base | Representation |
---|---|
bin | 111000011111000001… |
… | …1001101001010100000 |
3 | 102121002121120010220221 |
4 | 1300332003031022200 |
5 | 3441410312041112 |
6 | 131420254212424 |
7 | 11522633640331 |
oct | 1607603151240 |
9 | 377077503827 |
10 | 121300112032 |
11 | 47496829580 |
12 | 1b6131b4114 |
13 | b591661328 |
14 | 5c29c96288 |
15 | 324e1b8e07 |
hex | 1c3e0cd2a0 |
121300112032 has 48 divisors (see below), whose sum is σ = 261440337312. Its totient is φ = 54941541120.
The previous prime is 121300111981. The next prime is 121300112051. The reversal of 121300112032 is 230211003121.
It is a super-5 number, since 5×1213001120325 (a number of 57 digits) contains 55555 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 121300111997 and 121300112015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 509223 + ... + 708454.
It is an arithmetic number, because the mean of its divisors is an integer number (5446673694).
Almost surely, 2121300112032 is an apocalyptic number.
It is an amenable number.
121300112032 is an abundant number, since it is smaller than the sum of its proper divisors (140140225280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121300112032 is a wasteful number, since it uses less digits than its factorization.
121300112032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217981 (or 1217973 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 121300112032 its reverse (230211003121), we get a palindrome (351511115153).
It can be divided in two parts, 121300 and 112032, that added together give a palindrome (233332).
The spelling of 121300112032 in words is "one hundred twenty-one billion, three hundred million, one hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •