Base | Representation |
---|---|
bin | 101101100100100010… |
… | …0110001101011110101 |
3 | 100100121020000221112220 |
4 | 1123021010301223311 |
5 | 3100410331044023 |
6 | 112542454232553 |
7 | 10033062450504 |
oct | 1331104615365 |
9 | 310536027486 |
10 | 97862753013 |
11 | 38559a77883 |
12 | 16b72055759 |
13 | 92c7ab015c |
14 | 4a4527a83b |
15 | 282b7b63e3 |
hex | 16c9131af5 |
97862753013 has 4 divisors (see below), whose sum is σ = 130483670688. Its totient is φ = 65241835340.
The previous prime is 97862752997. The next prime is 97862753059. The reversal of 97862753013 is 31035726879.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31035726879 = 3 ⋅10345242293.
It is a cyclic number.
It is not a de Polignac number, because 97862753013 - 24 = 97862752997 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97862733013) 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, 16310458833 + ... + 16310458838.
It is an arithmetic number, because the mean of its divisors is an integer number (32620917672).
Almost surely, 297862753013 is an apocalyptic number.
It is an amenable number.
97862753013 is a deficient number, since it is larger than the sum of its proper divisors (32620917675).
97862753013 is a wasteful number, since it uses less digits than its factorization.
97862753013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32620917674.
The product of its (nonzero) digits is 1905120, while the sum is 51.
The spelling of 97862753013 in words is "ninety-seven billion, eight hundred sixty-two million, seven hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •