Base | Representation |
---|---|
bin | 1000001110110011110000… |
… | …1100100000101000001001 |
3 | 1012001012221022202201100011 |
4 | 2003230330030200220021 |
5 | 2141240414014130001 |
6 | 31125424533311521 |
7 | 1622606655505246 |
oct | 203547414405011 |
9 | 35035838681304 |
10 | 9050506005001 |
11 | 297a33076a22a |
12 | 10220701955a1 |
13 | 5085c7707b56 |
14 | 2340926d25cd |
15 | 10a6576c3d51 |
hex | 83b3c320a09 |
9050506005001 has 8 divisors (see below), whose sum is σ = 9444124920384. Its totient is φ = 8656896977520.
The previous prime is 9050506004987. The next prime is 9050506005017. The reversal of 9050506005001 is 1005006050509.
It is a happy number.
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 9050506005001 - 221 = 9050503907849 is a prime.
It is a super-2 number, since 2×90505060050012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9050506005031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 570415 + ... + 4292596.
It is an arithmetic number, because the mean of its divisors is an integer number (1180515615048).
Almost surely, 29050506005001 is an apocalyptic number.
It is an amenable number.
9050506005001 is a deficient number, since it is larger than the sum of its proper divisors (393618915383).
9050506005001 is a wasteful number, since it uses less digits than its factorization.
9050506005001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4943951.
The product of its (nonzero) digits is 6750, while the sum is 31.
The spelling of 9050506005001 in words is "nine trillion, fifty billion, five hundred six million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •