Base | Representation |
---|---|
bin | 111000011111000101… |
… | …0100001100000110110 |
3 | 102121002202011121102020 |
4 | 1300332022201200312 |
5 | 3441411304433030 |
6 | 131420403254010 |
7 | 11522656150242 |
oct | 1607612414066 |
9 | 377082147366 |
10 | 121302030390 |
11 | 474979198a2 |
12 | 1b61397a306 |
13 | b591b83558 |
14 | 5c2a235422 |
15 | 324e447510 |
hex | 1c3e2a1836 |
121302030390 has 32 divisors (see below), whose sum is σ = 291137816160. Its totient is φ = 32345769984.
The previous prime is 121302030389. The next prime is 121302030427. The reversal of 121302030390 is 93030203121.
121302030390 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 121302030390.
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 15 ways as a sum of consecutive naturals, for example, 714006 + ... + 867414.
It is an arithmetic number, because the mean of its divisors is an integer number (9098056755).
Almost surely, 2121302030390 is an apocalyptic number.
121302030390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121302030390 is an abundant number, since it is smaller than the sum of its proper divisors (169835785770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121302030390 is a wasteful number, since it uses less digits than its factorization.
121302030390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179776.
The product of its (nonzero) digits is 972, while the sum is 24.
The spelling of 121302030390 in words is "one hundred twenty-one billion, three hundred two million, thirty thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •