Base | Representation |
---|---|
bin | 1000011110100011000… |
… | …1100100100000011111 |
3 | 111220220211220102021222 |
4 | 2013220301210200133 |
5 | 4341232120320341 |
6 | 150523350043555 |
7 | 13344035011361 |
oct | 2075061444037 |
9 | 456824812258 |
10 | 145639229471 |
11 | 5684660376a |
12 | 242863495bb |
13 | 1096cca3378 |
14 | 7098568d31 |
15 | 3bc5d4444b |
hex | 21e8c6481f |
145639229471 has 4 divisors (see below), whose sum is σ = 145640950344. Its totient is φ = 145637508600.
The previous prime is 145639229447. The next prime is 145639229497. The reversal of 145639229471 is 174922936541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 174922936541 = 23 ⋅7605345067.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145639229471 is a prime.
It is a super-3 number, since 3×1456392294713 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145639229431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 726545 + ... + 905066.
It is an arithmetic number, because the mean of its divisors is an integer number (36410237586).
Almost surely, 2145639229471 is an apocalyptic number.
145639229471 is a deficient number, since it is larger than the sum of its proper divisors (1720873).
145639229471 is an equidigital number, since it uses as much as digits as its factorization.
145639229471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1720872.
The product of its digits is 3265920, while the sum is 53.
The spelling of 145639229471 in words is "one hundred forty-five billion, six hundred thirty-nine million, two hundred twenty-nine thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •