Base | Representation |
---|---|
bin | 1000101110101… |
… | …00011000001001 |
3 | 12002210001012122 |
4 | 10113110120021 |
5 | 122221043031 |
6 | 11133221025 |
7 | 1546242113 |
oct | 427243011 |
9 | 162701178 |
10 | 73221641 |
11 | 38371559 |
12 | 20631775 |
13 | 1222901c |
14 | 9a203b3 |
15 | 666547b |
hex | 45d4609 |
73221641 has 2 divisors, whose sum is σ = 73221642. Its totient is φ = 73221640.
The previous prime is 73221623. The next prime is 73221677. The reversal of 73221641 is 14612237.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39639616 + 33582025 = 6296^2 + 5795^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-73221641 is a prime.
It is a super-2 number, since 2×732216412 = 10722817421465762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 73221641.
It is not a weakly prime, because it can be changed into another prime (73221341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36610820 + 36610821.
It is an arithmetic number, because the mean of its divisors is an integer number (36610821).
Almost surely, 273221641 is an apocalyptic number.
It is an amenable number.
73221641 is a deficient number, since it is larger than the sum of its proper divisors (1).
73221641 is an equidigital number, since it uses as much as digits as its factorization.
73221641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2016, while the sum is 26.
The square root of 73221641 is about 8556.9644734567. The cubic root of 73221641 is about 418.3564662195.
Adding to 73221641 its reverse (14612237), we get a palindrome (87833878).
The spelling of 73221641 in words is "seventy-three million, two hundred twenty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •