Base | Representation |
---|---|
bin | 1110100111000111001010… |
… | …10001110000110101010011 |
3 | 11012202121200000121011211101 |
4 | 13103203211101300311103 |
5 | 13202410123203404021 |
6 | 152200224441125231 |
7 | 6524221233631654 |
oct | 723434521606523 |
9 | 135677600534741 |
10 | 32130202013011 |
11 | a268384449373 |
12 | 372b06b789817 |
13 | 14c0b3268876b |
14 | 7d117808d52b |
15 | 3aaba8720a91 |
hex | 1d38e5470d53 |
32130202013011 has 2 divisors, whose sum is σ = 32130202013012. Its totient is φ = 32130202013010.
The previous prime is 32130202013003. The next prime is 32130202013051. The reversal of 32130202013011 is 11031020203123.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 32130202013011 - 23 = 32130202013003 is a prime.
It is a super-2 number, since 2×321302020130112 (a number of 28 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 32130202013011.
It is not a weakly prime, because it can be changed into another prime (32130202013051) 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, 16065101006505 + 16065101006506.
It is an arithmetic number, because the mean of its divisors is an integer number (16065101006506).
Almost surely, 232130202013011 is an apocalyptic number.
32130202013011 is a deficient number, since it is larger than the sum of its proper divisors (1).
32130202013011 is an equidigital number, since it uses as much as digits as its factorization.
32130202013011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 32130202013011 its reverse (11031020203123), we get a palindrome (43161222216134).
The spelling of 32130202013011 in words is "thirty-two trillion, one hundred thirty billion, two hundred two million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •