Base | Representation |
---|---|
bin | 1001001011110001100001… |
… | …0000000100001011010011 |
3 | 1022202100101021021021012201 |
4 | 2102330120100010023103 |
5 | 2310420421443234431 |
6 | 33250522201304031 |
7 | 2061355520051020 |
oct | 222743020041323 |
9 | 38670337237181 |
10 | 10097874977491 |
11 | 32435371a0274 |
12 | 1171051a95017 |
13 | 5832c16288a2 |
14 | 26ca4dc6c547 |
15 | 127a07821461 |
hex | 92f184042d3 |
10097874977491 has 4 divisors (see below), whose sum is σ = 11540428545712. Its totient is φ = 8655321409272.
The previous prime is 10097874977483. The next prime is 10097874977537. The reversal of 10097874977491 is 19477947879001.
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 10097874977491 - 23 = 10097874977483 is a prime.
It is a super-2 number, since 2×100978749774912 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10097874977791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 721276784100 + ... + 721276784113.
It is an arithmetic number, because the mean of its divisors is an integer number (2885107136428).
Almost surely, 210097874977491 is an apocalyptic number.
10097874977491 is a deficient number, since it is larger than the sum of its proper divisors (1442553568221).
10097874977491 is an equidigital number, since it uses as much as digits as its factorization.
10097874977491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1442553568220.
The product of its (nonzero) digits is 224042112, while the sum is 73.
The spelling of 10097874977491 in words is "ten trillion, ninety-seven billion, eight hundred seventy-four million, nine hundred seventy-seven thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •