Base | Representation |
---|---|
bin | 1000001011111000000001… |
… | …0111100000100001110001 |
3 | 1011212101212011001002002212 |
4 | 2002332000113200201301 |
5 | 2134424211143200223 |
6 | 31050332111021505 |
7 | 1616144055604640 |
oct | 202760027404161 |
9 | 34771764032085 |
10 | 9000110131313 |
11 | 295aa1a59a444 |
12 | 101434680a895 |
13 | 50392593ca52 |
14 | 231871593357 |
15 | 1091a81d3278 |
hex | 82f805e0871 |
9000110131313 has 16 divisors (see below), whose sum is σ = 10534234314240. Its totient is φ = 7530263387136.
The previous prime is 9000110131249. The next prime is 9000110131361. The reversal of 9000110131313 is 3131310110009.
It is not a de Polignac number, because 9000110131313 - 26 = 9000110131249 is a prime.
It is a super-2 number, since 2×90001101313132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (9000110131213) 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 15 ways as a sum of consecutive naturals, for example, 90737753 + ... + 90836886.
It is an arithmetic number, because the mean of its divisors is an integer number (658389644640).
Almost surely, 29000110131313 is an apocalyptic number.
It is an amenable number.
9000110131313 is a deficient number, since it is larger than the sum of its proper divisors (1534124182927).
9000110131313 is a wasteful number, since it uses less digits than its factorization.
9000110131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181574816.
The product of its (nonzero) digits is 243, while the sum is 23.
The spelling of 9000110131313 in words is "nine trillion, one hundred ten million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •