Base | Representation |
---|---|
bin | 1000100000111001101… |
… | …1110100101011001011 |
3 | 111222112212210212120211 |
4 | 2020032123310223023 |
5 | 4344030343001411 |
6 | 151110200301551 |
7 | 13365506343013 |
oct | 2101633645313 |
9 | 458485725524 |
10 | 146271062731 |
11 | 57040224412 |
12 | 24421a718b7 |
13 | 10a40b664c1 |
14 | 711843ac43 |
15 | 3c1154e221 |
hex | 220e6f4acb |
146271062731 has 4 divisors (see below), whose sum is σ = 146336045464. Its totient is φ = 146206080000.
The previous prime is 146271062713. The next prime is 146271062761. The reversal of 146271062731 is 137260172641.
146271062731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 146271062731 - 25 = 146271062699 is a prime.
It is a super-2 number, since 2×1462710627312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146271062701) 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 in 3 ways as a sum of consecutive naturals, for example, 32487990 + ... + 32492491.
It is an arithmetic number, because the mean of its divisors is an integer number (36584011366).
Almost surely, 2146271062731 is an apocalyptic number.
146271062731 is a deficient number, since it is larger than the sum of its proper divisors (64982733).
146271062731 is an equidigital number, since it uses as much as digits as its factorization.
146271062731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64982732.
The product of its (nonzero) digits is 84672, while the sum is 40.
The spelling of 146271062731 in words is "one hundred forty-six billion, two hundred seventy-one million, sixty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •