Base | Representation |
---|---|
bin | 11111000010100010101… |
… | …000011111111011001011 |
3 | 21112220201200121010010201 |
4 | 133002202220133323023 |
5 | 234421422232214311 |
6 | 4311522420553031 |
7 | 310051346301565 |
oct | 37024250377313 |
9 | 7486650533121 |
10 | 2133032304331 |
11 | 752683145055 |
12 | 2a5490252777 |
13 | 1261b4721206 |
14 | 7534c970335 |
15 | 3a7421669c1 |
hex | 1f0a2a1fecb |
2133032304331 has 2 divisors, whose sum is σ = 2133032304332. Its totient is φ = 2133032304330.
The previous prime is 2133032304307. The next prime is 2133032304419. The reversal of 2133032304331 is 1334032303312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2133032304331 - 221 = 2133030207179 is a prime.
It is a super-2 number, since 2×21330323043312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2133032304331.
It is not a weakly prime, because it can be changed into another prime (2133332304331) 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 as a sum of consecutive naturals, namely, 1066516152165 + 1066516152166.
It is an arithmetic number, because the mean of its divisors is an integer number (1066516152166).
Almost surely, 22133032304331 is an apocalyptic number.
2133032304331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2133032304331 is an equidigital number, since it uses as much as digits as its factorization.
2133032304331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 2133032304331 its reverse (1334032303312), we get a palindrome (3467064607643).
The spelling of 2133032304331 in words is "two trillion, one hundred thirty-three billion, thirty-two million, three hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •