Base | Representation |
---|---|
bin | 1000100011111000101… |
… | …1000010110110110011 |
3 | 112001121200212012211101 |
4 | 2020332023002312303 |
5 | 4402200411030424 |
6 | 151321450425231 |
7 | 13424403060541 |
oct | 2107613026663 |
9 | 461550765741 |
10 | 147071970739 |
11 | 57411325461 |
12 | 24606132217 |
13 | 10b3aa76775 |
14 | 7192960d91 |
15 | 3c5ba05344 |
hex | 223e2c2db3 |
147071970739 has 2 divisors, whose sum is σ = 147071970740. Its totient is φ = 147071970738.
The previous prime is 147071970709. The next prime is 147071970757. The reversal of 147071970739 is 937079170741.
147071970739 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 147071970739 - 27 = 147071970611 is a prime.
It is a super-2 number, since 2×1470719707392 (a number of 23 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 147071970739.
It is not a weakly prime, because it can be changed into another prime (147071970709) 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, 73535985369 + 73535985370.
It is an arithmetic number, because the mean of its divisors is an integer number (73535985370).
Almost surely, 2147071970739 is an apocalyptic number.
147071970739 is a deficient number, since it is larger than the sum of its proper divisors (1).
147071970739 is an equidigital number, since it uses as much as digits as its factorization.
147071970739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2333772, while the sum is 55.
The spelling of 147071970739 in words is "one hundred forty-seven billion, seventy-one million, nine hundred seventy thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •