Base | Representation |
---|---|
bin | 111000100101000101… |
… | …1000111000111111000 |
3 | 102121121210021212220020 |
4 | 1301022023013013320 |
5 | 3442314344323112 |
6 | 131452401530440 |
7 | 11530653542331 |
oct | 1611213070770 |
9 | 377553255806 |
10 | 121503511032 |
11 | 47590623222 |
12 | 1b66b343a20 |
13 | b5c4838777 |
14 | 5c48cc1288 |
15 | 3261e9548c |
hex | 1c4a2c71f8 |
121503511032 has 16 divisors (see below), whose sum is σ = 303758777640. Its totient is φ = 40501170336.
The previous prime is 121503510923. The next prime is 121503511091. The reversal of 121503511032 is 230115305121.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 5062646293 = 121503511032 / (1 + 2 + 1 + 5 + 0 + 3 + 5 + 1 + 1 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 121503510993 and 121503511011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2531323123 + ... + 2531323170.
Almost surely, 2121503511032 is an apocalyptic number.
121503511032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121503511032 is an abundant number, since it is smaller than the sum of its proper divisors (182255266608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121503511032 is a wasteful number, since it uses less digits than its factorization.
121503511032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5062646302 (or 5062646298 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 121503511032 its reverse (230115305121), we get a palindrome (351618816153).
The spelling of 121503511032 in words is "one hundred twenty-one billion, five hundred three million, five hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •