Base | Representation |
---|---|
bin | 1001101010011001101… |
… | …11101000010001011001 |
3 | 1011201221210120211101022 |
4 | 10311030313220101121 |
5 | 20414420021224311 |
6 | 412304125532225 |
7 | 32662215366023 |
oct | 4651467502131 |
9 | 1151853524338 |
10 | 332002133081 |
11 | 11888a604573 |
12 | 54416a14075 |
13 | 253ccc36c28 |
14 | 120d743d013 |
15 | 8981e6c5db |
hex | 4d4cde8459 |
332002133081 has 2 divisors, whose sum is σ = 332002133082. Its totient is φ = 332002133080.
The previous prime is 332002133003. The next prime is 332002133087. The reversal of 332002133081 is 180331200233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 318186246400 + 13815886681 = 564080^2 + 117541^2 .
It is a cyclic number.
It is not a de Polignac number, because 332002133081 - 234 = 314822263897 is a prime.
It is a super-2 number, since 2×3320021330812 (a number of 24 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 332002133081.
It is not a weakly prime, because it can be changed into another prime (332002133087) 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, 166001066540 + 166001066541.
It is an arithmetic number, because the mean of its divisors is an integer number (166001066541).
Almost surely, 2332002133081 is an apocalyptic number.
It is an amenable number.
332002133081 is a deficient number, since it is larger than the sum of its proper divisors (1).
332002133081 is an equidigital number, since it uses as much as digits as its factorization.
332002133081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
The spelling of 332002133081 in words is "three hundred thirty-two billion, two million, one hundred thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •