Base | Representation |
---|---|
bin | 111000011001000101… |
… | …1101100010001010010 |
3 | 102120120201220201021200 |
4 | 1300302023230101102 |
5 | 3441003324310002 |
6 | 131344422532030 |
7 | 11514665413050 |
oct | 1606213542122 |
9 | 376521821250 |
10 | 121101010002 |
11 | 473a43aa245 |
12 | 1b578597016 |
13 | b55c32c98b |
14 | 5c0b6691d0 |
15 | 323b98ab1c |
hex | 1c322ec452 |
121101010002 has 96 divisors (see below), whose sum is σ = 303402153600. Its totient is φ = 34194424320.
The previous prime is 121101009977. The next prime is 121101010003. The reversal of 121101010002 is 200010101121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (121101010003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4956877 + ... + 4981247.
It is an arithmetic number, because the mean of its divisors is an integer number (3160439100).
Almost surely, 2121101010002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121101010002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151701076800).
121101010002 is an abundant number, since it is smaller than the sum of its proper divisors (182301143598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121101010002 is a wasteful number, since it uses less digits than its factorization.
121101010002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24848 (or 24845 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 121101010002 its reverse (200010101121), we get a palindrome (321111111123).
The spelling of 121101010002 in words is "one hundred twenty-one billion, one hundred one million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •