Base | Representation |
---|---|
bin | 10100100010011110100011… |
… | …100110101001110111010011 |
3 | 102211211111001002102221202002 |
4 | 110202132203212221313103 |
5 | 43314432223204140311 |
6 | 520041042200544215 |
7 | 25012066420402526 |
oct | 2442364346516723 |
9 | 384744032387662 |
10 | 90330202021331 |
11 | 26866907157068 |
12 | a16a721a8206b |
13 | 3b53141cc577c |
14 | 184401001abbd |
15 | a69a6876c93b |
hex | 5227a39a9dd3 |
90330202021331 has 8 divisors (see below), whose sum is σ = 90508623696000. Its totient is φ = 90151784095360.
The previous prime is 90330202021291. The next prime is 90330202021403. The reversal of 90330202021331 is 13312020203309.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-90330202021331 is a prime.
It is a super-2 number, since 2×903302020213312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90330202021294 and 90330202021303.
It is not an unprimeable number, because it can be changed into a prime (90330202021231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50038046 + ... + 51811836.
It is an arithmetic number, because the mean of its divisors is an integer number (11313577962000).
Almost surely, 290330202021331 is an apocalyptic number.
90330202021331 is a deficient number, since it is larger than the sum of its proper divisors (178421674669).
90330202021331 is a wasteful number, since it uses less digits than its factorization.
90330202021331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1874349.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 90330202021331 in words is "ninety trillion, three hundred thirty billion, two hundred two million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •