Base | Representation |
---|---|
bin | 11011100100001010010011… |
… | …011111000110101001010010 |
3 | 120220020200112221112211212122 |
4 | 123210022103133012221102 |
5 | 111342232042123120310 |
6 | 1105501151423454242 |
7 | 34351511313344216 |
oct | 3344122337065122 |
9 | 526220487484778 |
10 | 121232221301330 |
11 | 356a0329452957 |
12 | 1171b749757382 |
13 | 52851c3358949 |
14 | 21d1956a26946 |
15 | e037dce93555 |
hex | 6e42937c6a52 |
121232221301330 has 32 divisors (see below), whose sum is σ = 218285543367936. Its totient is φ = 48477880874304.
The previous prime is 121232221301329. The next prime is 121232221301381. The reversal of 121232221301330 is 33103122232121.
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 121232221301330.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 430116107 + ... + 430397873.
It is an arithmetic number, because the mean of its divisors is an integer number (6821423230248).
Almost surely, 2121232221301330 is an apocalyptic number.
121232221301330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121232221301330 is a deficient number, since it is larger than the sum of its proper divisors (97053322066606).
121232221301330 is a wasteful number, since it uses less digits than its factorization.
121232221301330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294938.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 121232221301330 its reverse (33103122232121), we get a palindrome (154335343533451).
The spelling of 121232221301330 in words is "one hundred twenty-one trillion, two hundred thirty-two billion, two hundred twenty-one million, three hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •