Base | Representation |
---|---|
bin | 1010000001101000100… |
… | …0111001101111101011 |
3 | 121110120111202000000122 |
4 | 2200122020321233223 |
5 | 10310220212430011 |
6 | 211042533353455 |
7 | 15305125216505 |
oct | 2403210715753 |
9 | 543514660018 |
10 | 172237233131 |
11 | 67055478577 |
12 | 29469a9888b |
13 | 1331b5c3a82 |
14 | 849cc46d75 |
15 | 4730e6e3db |
hex | 281a239beb |
172237233131 has 2 divisors, whose sum is σ = 172237233132. Its totient is φ = 172237233130.
The previous prime is 172237233079. The next prime is 172237233151. The reversal of 172237233131 is 131332732271.
172237233131 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 is a cyclic number.
It is not a de Polignac number, because 172237233131 - 218 = 172236970987 is a prime.
It is a super-2 number, since 2×1722372331312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 172237233091 and 172237233100.
It is not a weakly prime, because it can be changed into another prime (172237233151) 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, 86118616565 + 86118616566.
It is an arithmetic number, because the mean of its divisors is an integer number (86118616566).
Almost surely, 2172237233131 is an apocalyptic number.
172237233131 is a deficient number, since it is larger than the sum of its proper divisors (1).
172237233131 is an equidigital number, since it uses as much as digits as its factorization.
172237233131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31752, while the sum is 35.
The spelling of 172237233131 in words is "one hundred seventy-two billion, two hundred thirty-seven million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •