Base | Representation |
---|---|
bin | 11011100000111110001010… |
… | …010000011001101010011110 |
3 | 120212110201202122111111121101 |
4 | 123200332022100121222132 |
5 | 111330134132404320110 |
6 | 1105212340530023314 |
7 | 34326621344503156 |
oct | 3340761220315236 |
9 | 525421678444541 |
10 | 121013023120030 |
11 | 35616375825a18 |
12 | 116a5174717b3a |
13 | 526a62c8007a2 |
14 | 21c50c0d3d766 |
15 | decc5e38913a |
hex | 6e0f8a419a9e |
121013023120030 has 8 divisors (see below), whose sum is σ = 217823441616072. Its totient is φ = 48405209248008.
The previous prime is 121013023120001. The next prime is 121013023120037. The reversal of 121013023120030 is 30021320310121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121013023120037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6050651155992 + ... + 6050651156011.
It is an arithmetic number, because the mean of its divisors is an integer number (27227930202009).
Almost surely, 2121013023120030 is an apocalyptic number.
121013023120030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121013023120030 is a deficient number, since it is larger than the sum of its proper divisors (96810418496042).
121013023120030 is a wasteful number, since it uses less digits than its factorization.
121013023120030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12101302312010.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121013023120030 its reverse (30021320310121), we get a palindrome (151034343430151).
The spelling of 121013023120030 in words is "one hundred twenty-one trillion, thirteen billion, twenty-three million, one hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •