Base | Representation |
---|---|
bin | 10100100001010111101100… |
… | …101111000111100111000001 |
3 | 102211120012122202212202102021 |
4 | 110201113230233013213001 |
5 | 43312210414102101021 |
6 | 515542100425521441 |
7 | 25003434135243334 |
oct | 2441275457074701 |
9 | 384505582782367 |
10 | 90254119565761 |
11 | 26837614636108 |
12 | a157a2a043281 |
13 | 3b48c086a23a8 |
14 | 184047369061b |
15 | a67ab4187c41 |
hex | 5215ecbc79c1 |
90254119565761 has 16 divisors (see below), whose sum is σ = 93679496870400. Its totient is φ = 86849729420608.
The previous prime is 90254119565749. The next prime is 90254119565773. The reversal of 90254119565761 is 16756591145209.
It is an interprime number because it is at equal distance from previous prime (90254119565749) and next prime (90254119565773).
It is a cyclic number.
It is not a de Polignac number, because 90254119565761 - 29 = 90254119565249 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 90254119565761.
It is not an unprimeable number, because it can be changed into a prime (90254119565741) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45349356 + ... + 47297698.
It is an arithmetic number, because the mean of its divisors is an integer number (5854968554400).
Almost surely, 290254119565761 is an apocalyptic number.
It is an amenable number.
90254119565761 is a deficient number, since it is larger than the sum of its proper divisors (3425377304639).
90254119565761 is a wasteful number, since it uses less digits than its factorization.
90254119565761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1953728.
The product of its (nonzero) digits is 20412000, while the sum is 61.
The spelling of 90254119565761 in words is "ninety trillion, two hundred fifty-four billion, one hundred nineteen million, five hundred sixty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •