Base | Representation |
---|---|
bin | 11101100100011110000… |
… | …001000101110000011101 |
3 | 21012021000012000120100221 |
4 | 131210132001011300131 |
5 | 231243040410230323 |
6 | 4153255403521341 |
7 | 266544266434333 |
oct | 35443601056035 |
9 | 7167005016327 |
10 | 2032023133213 |
11 | 71385a0a1837 |
12 | 2899a0529251 |
13 | 119807b130c8 |
14 | 704c9895b53 |
15 | 37cce53855d |
hex | 1d91e045c1d |
2032023133213 has 2 divisors, whose sum is σ = 2032023133214. Its totient is φ = 2032023133212.
The previous prime is 2032023133211. The next prime is 2032023133229. The reversal of 2032023133213 is 3123313202302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1220101394724 + 811921738489 = 1104582^2 + 901067^2 .
It is a cyclic number.
It is not a de Polignac number, because 2032023133213 - 21 = 2032023133211 is a prime.
Together with 2032023133211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2032023133211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016011566606 + 1016011566607.
It is an arithmetic number, because the mean of its divisors is an integer number (1016011566607).
Almost surely, 22032023133213 is an apocalyptic number.
It is an amenable number.
2032023133213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2032023133213 is an equidigital number, since it uses as much as digits as its factorization.
2032023133213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 2032023133213 its reverse (3123313202302), we get a palindrome (5155336335515).
The spelling of 2032023133213 in words is "two trillion, thirty-two billion, twenty-three million, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •