Base | Representation |
---|---|
bin | 111000011100001000… |
… | …0110011010110010110 |
3 | 102120211211212000010000 |
4 | 1300320100303112112 |
5 | 3441210432404024 |
6 | 131402505112130 |
7 | 11520344416656 |
oct | 1607020632626 |
9 | 376754760100 |
10 | 121203013014 |
11 | 47446a39656 |
12 | 1b5a6788646 |
13 | b5774c50a5 |
14 | 5c1b01c366 |
15 | 32458d8cc9 |
hex | 1c38433596 |
121203013014 has 80 divisors (see below), whose sum is σ = 284109854688. Its totient is φ = 38546627328.
The previous prime is 121203013013. The next prime is 121203013039. The reversal of 121203013014 is 410310302121.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121203013013) 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 39 ways as a sum of consecutive naturals, for example, 1438254 + ... + 1520190.
Almost surely, 2121203013014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121203013014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142054927344).
121203013014 is an abundant number, since it is smaller than the sum of its proper divisors (162906841674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121203013014 is a wasteful number, since it uses less digits than its factorization.
121203013014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82371 (or 82362 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 121203013014 its reverse (410310302121), we get a palindrome (531513315135).
The spelling of 121203013014 in words is "one hundred twenty-one billion, two hundred three million, thirteen thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •