Base | Representation |
---|---|
bin | 11011100001010001000010… |
… | …111011001000110010011110 |
3 | 120212112200002212021200220101 |
4 | 123201101002323020302132 |
5 | 111331002200101400110 |
6 | 1105225533031411314 |
7 | 34331240014363012 |
oct | 3341210273106236 |
9 | 525480085250811 |
10 | 121033301200030 |
11 | 35623a3121761a |
12 | 116a9093823b3a |
13 | 526c51199cbab |
14 | 21c6086130542 |
15 | ded54973413a |
hex | 6e1442ec8c9e |
121033301200030 has 64 divisors (see below), whose sum is σ = 232754415264000. Its totient is φ = 45179650568448.
The previous prime is 121033301200027. The next prime is 121033301200037. The reversal of 121033301200030 is 30002103330121.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 121033301199980 and 121033301200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121033301200037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 753650281 + ... + 753810859.
It is an arithmetic number, because the mean of its divisors is an integer number (3636787738500).
Almost surely, 2121033301200030 is an apocalyptic number.
121033301200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121033301200030 is a deficient number, since it is larger than the sum of its proper divisors (111721114063970).
121033301200030 is a wasteful number, since it uses less digits than its factorization.
121033301200030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219881.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 121033301200030 its reverse (30002103330121), we get a palindrome (151035404530151).
The spelling of 121033301200030 in words is "one hundred twenty-one trillion, thirty-three billion, three hundred one million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •