Base | Representation |
---|---|
bin | 1011000110111010001010… |
… | …1010101100010011000011 |
3 | 1121020120201100101221201012 |
4 | 2301232202222230103003 |
5 | 3100100340201414021 |
6 | 41550420002031135 |
7 | 2400245324440601 |
oct | 261564252542303 |
9 | 47216640357635 |
10 | 12213321123011 |
11 | 3989705411978 |
12 | 14530346484ab |
13 | 6a7932795b68 |
14 | 3031b0d3a871 |
15 | 162a6aac935b |
hex | b1ba2aac4c3 |
12213321123011 has 4 divisors (see below), whose sum is σ = 12268089379392. Its totient is φ = 12158552866632.
The previous prime is 12213321123001. The next prime is 12213321123103. The reversal of 12213321123011 is 11032112331221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12213321123011 - 234 = 12196141253827 is a prime.
It is a super-2 number, since 2×122133211230112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12213321123001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27384127856 + ... + 27384128301.
It is an arithmetic number, because the mean of its divisors is an integer number (3067022344848).
Almost surely, 212213321123011 is an apocalyptic number.
12213321123011 is a deficient number, since it is larger than the sum of its proper divisors (54768256381).
12213321123011 is an equidigital number, since it uses as much as digits as its factorization.
12213321123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54768256380.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 12213321123011 its reverse (11032112331221), we get a palindrome (23245433454232).
The spelling of 12213321123011 in words is "twelve trillion, two hundred thirteen billion, three hundred twenty-one million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •