Base | Representation |
---|---|
bin | 100101111100001110… |
… | …0101001100010101011 |
3 | 21210022022121112122121 |
4 | 1023320130221202223 |
5 | 2313331240433313 |
6 | 101232541132111 |
7 | 5613043530364 |
oct | 1137034514253 |
9 | 253268545577 |
10 | 81477671083 |
11 | 31611026256 |
12 | 1395a85a037 |
13 | 78b63098c3 |
14 | 3d2d108b6b |
15 | 21bd0a728d |
hex | 12f87298ab |
81477671083 has 4 divisors (see below), whose sum is σ = 81891263520. Its totient is φ = 81064078648.
The previous prime is 81477671047. The next prime is 81477671089. The reversal of 81477671083 is 38017677418.
It is a happy number.
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 81477671083 - 213 = 81477662891 is a prime.
It is a super-2 number, since 2×814776710832 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 81477671083.
It is not an unprimeable number, because it can be changed into a prime (81477671089) 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, 206795923 + ... + 206796316.
It is an arithmetic number, because the mean of its divisors is an integer number (20472815880).
Almost surely, 281477671083 is an apocalyptic number.
81477671083 is a deficient number, since it is larger than the sum of its proper divisors (413592437).
81477671083 is a wasteful number, since it uses less digits than its factorization.
81477671083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413592436.
The product of its (nonzero) digits is 1580544, while the sum is 52.
The spelling of 81477671083 in words is "eighty-one billion, four hundred seventy-seven million, six hundred seventy-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •