Base | Representation |
---|---|
bin | 101101001100000111… |
… | …0101111011110111101 |
3 | 100021111010001111110012 |
4 | 1122120032233132331 |
5 | 3042221040004403 |
6 | 112325302153005 |
7 | 10003552166660 |
oct | 1323016573675 |
9 | 307433044405 |
10 | 97043281853 |
11 | 38179447a91 |
12 | 16983722765 |
13 | 91c70a078b |
14 | 49a84c36d7 |
15 | 27ce894ed8 |
hex | 16983af7bd |
97043281853 has 12 divisors (see below), whose sum is σ = 112754584800. Its totient is φ = 81816328080.
The previous prime is 97043281847. The next prime is 97043281859. The reversal of 97043281853 is 35818234079.
It is an interprime number because it is at equal distance from previous prime (97043281847) and next prime (97043281859).
It is not a de Polignac number, because 97043281853 - 26 = 97043281789 is a prime.
It is a super-2 number, since 2×970432818532 (a number of 23 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 (97043281859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1836803 + ... + 1888896.
It is an arithmetic number, because the mean of its divisors is an integer number (9396215400).
Almost surely, 297043281853 is an apocalyptic number.
It is an amenable number.
97043281853 is a deficient number, since it is larger than the sum of its proper divisors (15711302947).
97043281853 is an equidigital number, since it uses as much as digits as its factorization.
97043281853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3725828 (or 3725767 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 50.
The spelling of 97043281853 in words is "ninety-seven billion, forty-three million, two hundred eighty-one thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •