Base | Representation |
---|---|
bin | 1010111010100100000110… |
… | …1110000100101111110101 |
3 | 1120111022022010122201110120 |
4 | 2232221001232010233311 |
5 | 3033112020223102013 |
6 | 41305143305442153 |
7 | 2346026642145642 |
oct | 256510156045765 |
9 | 46438263581416 |
10 | 12001241222133 |
11 | 3907774886419 |
12 | 1419b074a0359 |
13 | 6909348b7c57 |
14 | 2d6c1279cdc9 |
15 | 15c2a6da0123 |
hex | aea41b84bf5 |
12001241222133 has 8 divisors (see below), whose sum is σ = 16127652246528. Its totient is φ = 7937828839584.
The previous prime is 12001241222123. The next prime is 12001241222197. The reversal of 12001241222133 is 33122214210021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12001241222133 - 214 = 12001241205749 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001241222123) 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 7 ways as a sum of consecutive naturals, for example, 15749660016 + ... + 15749660777.
It is an arithmetic number, because the mean of its divisors is an integer number (2015956530816).
Almost surely, 212001241222133 is an apocalyptic number.
It is an amenable number.
12001241222133 is a deficient number, since it is larger than the sum of its proper divisors (4126411024395).
12001241222133 is a wasteful number, since it uses less digits than its factorization.
12001241222133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31499320923.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 12001241222133 its reverse (33122214210021), we get a palindrome (45123455432154).
The spelling of 12001241222133 in words is "twelve trillion, one billion, two hundred forty-one million, two hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •