Base | Representation |
---|---|
bin | 101001111110101011… |
… | …1001110011100110101 |
3 | 22121200201021001120001 |
4 | 1103331113032130311 |
5 | 2434111404220234 |
6 | 105225300511301 |
7 | 6341000644423 |
oct | 1237527163465 |
9 | 277621231501 |
10 | 90150070069 |
11 | 35261400a44 |
12 | 1557b0ab531 |
13 | 8668c47037 |
14 | 4512c04113 |
15 | 2529621d14 |
hex | 14fd5ce735 |
90150070069 has 4 divisors (see below), whose sum is σ = 90258816460. Its totient is φ = 90041323680.
The previous prime is 90150070063. The next prime is 90150070123. The reversal of 90150070069 is 96007005109.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51924736900 + 38225333169 = 227870^2 + 195513^2 .
It is a cyclic number.
It is not a de Polignac number, because 90150070069 - 215 = 90150037301 is a prime.
It is a super-2 number, since 2×901500700692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90150070063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54371952 + ... + 54373609.
It is an arithmetic number, because the mean of its divisors is an integer number (22564704115).
Almost surely, 290150070069 is an apocalyptic number.
It is an amenable number.
90150070069 is a deficient number, since it is larger than the sum of its proper divisors (108746391).
90150070069 is a wasteful number, since it uses less digits than its factorization.
90150070069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108746390.
The product of its (nonzero) digits is 17010, while the sum is 37.
The spelling of 90150070069 in words is "ninety billion, one hundred fifty million, seventy thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •