Base | Representation |
---|---|
bin | 10100011110100100010101… |
… | …000011100100100110000011 |
3 | 102210212210112100111110200021 |
4 | 110132210111003210212003 |
5 | 43301031444224101213 |
6 | 515313405310034311 |
7 | 24653505325140145 |
oct | 2436442503444603 |
9 | 383783470443607 |
10 | 90061522487683 |
11 | 267729715aa7aa |
12 | a1266397a8997 |
13 | 3b339c3cb16b6 |
14 | 1835002850c95 |
15 | a62a90abbd8d |
hex | 51e9150e4983 |
90061522487683 has 8 divisors (see below), whose sum is σ = 90909105607760. Its totient is φ = 89214327197280.
The previous prime is 90061522487647. The next prime is 90061522487711. The reversal of 90061522487683 is 38678422516009.
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-90061522487683 is a prime.
It is a super-2 number, since 2×900615224876832 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (90061522487983) 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, 96490785 + ... + 97419682.
It is an arithmetic number, because the mean of its divisors is an integer number (11363638200970).
It is a 3-persistent number, because k⋅90061522487683 is pandigital for 1 ≤ k ≤ 3, but not for k = 4.
Almost surely, 290061522487683 is an apocalyptic number.
90061522487683 is a deficient number, since it is larger than the sum of its proper divisors (847583120077).
90061522487683 is a wasteful number, since it uses less digits than its factorization.
90061522487683 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193914837.
The product of its (nonzero) digits is 34836480, while the sum is 61.
The spelling of 90061522487683 in words is "ninety trillion, sixty-one billion, five hundred twenty-two million, four hundred eighty-seven thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •