Base | Representation |
---|---|
bin | 10010111001111100101011… |
… | …011011010101110100101111 |
3 | 101220101202221102102221110201 |
4 | 102321330223123111310233 |
5 | 41344240024110031311 |
6 | 452501112114214331 |
7 | 23341113116553613 |
oct | 2271745333256457 |
9 | 356352842387421 |
10 | 83147000470831 |
11 | 24547499145340 |
12 | 93aa5422843a7 |
13 | 375196169342b |
14 | 167649cb19343 |
15 | 992c9e75c9c1 |
hex | 4b9f2b6d5d2f |
83147000470831 has 8 divisors (see below), whose sum is σ = 91161626832000. Its totient is φ = 75208342132440.
The previous prime is 83147000470813. The next prime is 83147000470871. The reversal of 83147000470831 is 13807400074138.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 83147000470831 - 211 = 83147000468783 is a prime.
It is a super-2 number, since 2×831470004708312 (a number of 29 digits) contains 22 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 (83147000470871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18992003401 + ... + 18992007778.
It is an arithmetic number, because the mean of its divisors is an integer number (11395203354000).
Almost surely, 283147000470831 is an apocalyptic number.
83147000470831 is a deficient number, since it is larger than the sum of its proper divisors (8014626361169).
83147000470831 is a wasteful number, since it uses less digits than its factorization.
83147000470831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37984011389.
The product of its (nonzero) digits is 451584, while the sum is 46.
The spelling of 83147000470831 in words is "eighty-three trillion, one hundred forty-seven billion, four hundred seventy thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •