Base | Representation |
---|---|
bin | 1000001101111111100011… |
… | …0010101111110101000001 |
3 | 1011222212202112200220212000 |
4 | 2003133320302233311001 |
5 | 2141023213002314121 |
6 | 31115150055454213 |
7 | 1621602440000115 |
oct | 203377062576501 |
9 | 34885675626760 |
10 | 9036490276161 |
11 | 29743991a8757 |
12 | 101b3ba387369 |
13 | 5071a2a7c98a |
14 | 2335230c3745 |
15 | 10a0d6ed5526 |
hex | 837f8cafd41 |
9036490276161 has 32 divisors (see below), whose sum is σ = 13541502768000. Its totient is φ = 5955258806784.
The previous prime is 9036490276153. The next prime is 9036490276171. The reversal of 9036490276161 is 1616720946309.
9036490276161 is a `hidden beast` number, since 9 + 0 + 36 + 490 + 2 + 7 + 61 + 61 = 666.
It is not a de Polignac number, because 9036490276161 - 23 = 9036490276153 is a prime.
It is a super-2 number, since 2×90364902761612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 9036490276098 and 9036490276107.
It is not an unprimeable number, because it can be changed into a prime (9036490276171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2751076 + ... + 5063733.
It is an arithmetic number, because the mean of its divisors is an integer number (423171961500).
Almost surely, 29036490276161 is an apocalyptic number.
It is an amenable number.
9036490276161 is a deficient number, since it is larger than the sum of its proper divisors (4505012491839).
9036490276161 is a wasteful number, since it uses less digits than its factorization.
9036490276161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7815310 (or 7815304 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 54.
The spelling of 9036490276161 in words is "nine trillion, thirty-six billion, four hundred ninety million, two hundred seventy-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •