Base | Representation |
---|---|
bin | 10100011111100001000010… |
… | …000111001110001011100101 |
3 | 102211010000202212222221102002 |
4 | 110133201002013032023211 |
5 | 43303113441422203423 |
6 | 515403345153055045 |
7 | 24661303500555161 |
oct | 2437410207161345 |
9 | 384100685887362 |
10 | 90126702928613 |
11 | 2679857a2287aa |
12 | a1371aa557485 |
13 | 3b39bb0a96c40 |
14 | 1838227335ca1 |
15 | a6460801a228 |
hex | 51f8421ce2e5 |
90126702928613 has 8 divisors (see below), whose sum is σ = 97059657542400. Its totient is φ = 83193767073648.
The previous prime is 90126702928609. The next prime is 90126702928637. The reversal of 90126702928613 is 31682920762109.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 90126702928613 - 22 = 90126702928609 is a prime.
It is a super-2 number, since 2×901267029286132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90126702928663) 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, 6230708 + ... + 14801186.
It is an arithmetic number, because the mean of its divisors is an integer number (12132457192800).
Almost surely, 290126702928613 is an apocalyptic number.
It is an amenable number.
90126702928613 is a deficient number, since it is larger than the sum of its proper divisors (6932954613787).
90126702928613 is a wasteful number, since it uses less digits than its factorization.
90126702928613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9379411.
The product of its (nonzero) digits is 3919104, while the sum is 56.
The spelling of 90126702928613 in words is "ninety trillion, one hundred twenty-six billion, seven hundred two million, nine hundred twenty-eight thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •