Base | Representation |
---|---|
bin | 111000010111000000… |
… | …1011100000011110110 |
3 | 102120101212120200012201 |
4 | 1300232001130003312 |
5 | 3440332442311202 |
6 | 131333450535114 |
7 | 11513160224116 |
oct | 1605601340366 |
9 | 376355520181 |
10 | 121031213302 |
11 | 47368a67a1a |
12 | 1b55913749a |
13 | b54aa3285c |
14 | 5c0229b046 |
15 | 32357a0387 |
hex | 1c2e05c0f6 |
121031213302 has 8 divisors (see below), whose sum is σ = 191101915800. Its totient is φ = 57330574704.
The previous prime is 121031213293. The next prime is 121031213327. The reversal of 121031213302 is 203312130121.
121031213302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 121031213302.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1592515927 + ... + 1592516002.
It is an arithmetic number, because the mean of its divisors is an integer number (23887739475).
Almost surely, 2121031213302 is an apocalyptic number.
121031213302 is a deficient number, since it is larger than the sum of its proper divisors (70070702498).
121031213302 is a wasteful number, since it uses less digits than its factorization.
121031213302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3185031950.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121031213302 its reverse (203312130121), we get a palindrome (324343343423).
The spelling of 121031213302 in words is "one hundred twenty-one billion, thirty-one million, two hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •