Base | Representation |
---|---|
bin | 101101011011111111… |
… | …1111110111101101101 |
3 | 100022212020222210221221 |
4 | 1122313333332331231 |
5 | 3044314012042023 |
6 | 112454222223341 |
7 | 10023013505065 |
oct | 1326777767555 |
9 | 308766883857 |
10 | 97576284013 |
11 | 384222a543a |
12 | 16ab2124b51 |
13 | 928063c180 |
14 | 4a191ca3a5 |
15 | 281157b85d |
hex | 16b7ffef6d |
97576284013 has 8 divisors (see below), whose sum is σ = 109650941568. Its totient is φ = 86154310704.
The previous prime is 97576284011. The next prime is 97576284041. The reversal of 97576284013 is 31048267579.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 97576284013 - 21 = 97576284011 is a prime.
It is a super-2 number, since 2×975762840132 (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 (97576284011) 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, 163170745 + ... + 163171342.
It is an arithmetic number, because the mean of its divisors is an integer number (13706367696).
It is a 1-persistent number, because it is pandigital, but 2⋅97576284013 = 195152568026 is not.
Almost surely, 297576284013 is an apocalyptic number.
It is an amenable number.
97576284013 is a deficient number, since it is larger than the sum of its proper divisors (12074657555).
97576284013 is a wasteful number, since it uses less digits than its factorization.
97576284013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326342123.
The product of its (nonzero) digits is 2540160, while the sum is 52.
The spelling of 97576284013 in words is "ninety-seven billion, five hundred seventy-six million, two hundred eighty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •