Base | Representation |
---|---|
bin | 1000101101000… |
… | …10001110100111 |
3 | 12002101121102212 |
4 | 10112202032213 |
5 | 122143004411 |
6 | 11124554035 |
7 | 1544425211 |
oct | 426421647 |
9 | 162347385 |
10 | 73016231 |
11 | 382411a2 |
12 | 2055291b |
13 | 12186692 |
14 | 99a95b1 |
15 | 662468b |
hex | 45a23a7 |
73016231 has 2 divisors, whose sum is σ = 73016232. Its totient is φ = 73016230.
The previous prime is 73016227. The next prime is 73016243. The reversal of 73016231 is 13261037.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 73016231 - 22 = 73016227 is a prime.
It is a super-2 number, since 2×730162312 = 10662739978890722, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 73016197 and 73016206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (73016291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36508115 + 36508116.
It is an arithmetic number, because the mean of its divisors is an integer number (36508116).
Almost surely, 273016231 is an apocalyptic number.
73016231 is a deficient number, since it is larger than the sum of its proper divisors (1).
73016231 is an equidigital number, since it uses as much as digits as its factorization.
73016231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 73016231 is about 8544.9535399556. The cubic root of 73016231 is about 417.9648921621.
Adding to 73016231 its reverse (13261037), we get a palindrome (86277268).
It can be divided in two parts, 730 and 16231, that added together give a palindrome (16961).
The spelling of 73016231 in words is "seventy-three million, sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •