Base | Representation |
---|---|
bin | 101001111100010011… |
… | …0101101001011010010 |
3 | 22121111011001101000222 |
4 | 1103320212231023102 |
5 | 2433430440221002 |
6 | 105213325513042 |
7 | 6336011265506 |
oct | 1237046551322 |
9 | 277434041028 |
10 | 90070242002 |
11 | 35220337a34 |
12 | 15558412782 |
13 | 8655546cb0 |
14 | 4506384306 |
15 | 25226041a2 |
hex | 14f89ad2d2 |
90070242002 has 8 divisors (see below), whose sum is σ = 145498083276. Its totient is φ = 41570880912.
The previous prime is 90070241981. The next prime is 90070242023. The reversal of 90070242002 is 20024207009.
It is an interprime number because it is at equal distance from previous prime (90070241981) and next prime (90070242023).
It can be written as a sum of positive squares in 2 ways, for example, as 89239015441 + 831226561 = 298729^2 + 28831^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×900702420022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 3464240077 = 90070242002 / (9 + 0 + 0 + 7 + 0 + 2 + 4 + 2 + 0 + 0 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1732120013 + ... + 1732120064.
Almost surely, 290070242002 is an apocalyptic number.
90070242002 is a deficient number, since it is larger than the sum of its proper divisors (55427841274).
90070242002 is a wasteful number, since it uses less digits than its factorization.
90070242002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3464240092.
The product of its (nonzero) digits is 2016, while the sum is 26.
The spelling of 90070242002 in words is "ninety billion, seventy million, two hundred forty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •