Base | Representation |
---|---|
bin | 1011000110110101010010… |
… | …1101011010011000110001 |
3 | 1121020110100012100020210022 |
4 | 2301231110231122120301 |
5 | 3100040200340310413 |
6 | 41550042121013225 |
7 | 2400201033414551 |
oct | 261552455323061 |
9 | 47213305306708 |
10 | 12212013213233 |
11 | 39890a41019a9 |
12 | 145292a624215 |
13 | 6a778481b852 |
14 | 3030c935b161 |
15 | 1629e0d75608 |
hex | b1b54b5a631 |
12212013213233 has 2 divisors, whose sum is σ = 12212013213234. Its totient is φ = 12212013213232.
The previous prime is 12212013213161. The next prime is 12212013213247. The reversal of 12212013213233 is 33231231021221.
12212013213233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11764268888464 + 447744324769 = 3429908^2 + 669137^2 .
It is a cyclic number.
It is not a de Polignac number, because 12212013213233 - 28 = 12212013212977 is a prime.
It is not a weakly prime, because it can be changed into another prime (12212013213263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106006606616 + 6106006606617.
It is an arithmetic number, because the mean of its divisors is an integer number (6106006606617).
Almost surely, 212212013213233 is an apocalyptic number.
It is an amenable number.
12212013213233 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212013213233 is an equidigital number, since it uses as much as digits as its factorization.
12212013213233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 12212013213233 its reverse (33231231021221), we get a palindrome (45443244234454).
The spelling of 12212013213233 in words is "twelve trillion, two hundred twelve billion, thirteen million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •