Base | Representation |
---|---|
bin | 1011010001010010… |
… | …01111101101010001 |
3 | 120121200021211112201 |
4 | 11220221033231101 |
5 | 44342424010001 |
6 | 2440221323201 |
7 | 302640223252 |
oct | 55051175521 |
9 | 16550254481 |
10 | 6050610001 |
11 | 2625458937 |
12 | 120a406501 |
13 | 755708a07 |
14 | 415824b29 |
15 | 2562d3501 |
hex | 168a4fb51 |
6050610001 has 8 divisors (see below), whose sum is σ = 6181346304. Its totient is φ = 5919957120.
The previous prime is 6050609993. The next prime is 6050610043. The reversal of 6050610001 is 1000160506.
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 6050610001 - 23 = 6050609993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6050670001) 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, 138816 + ... + 177118.
It is an arithmetic number, because the mean of its divisors is an integer number (772668288).
Almost surely, 26050610001 is an apocalyptic number.
It is an amenable number.
6050610001 is a deficient number, since it is larger than the sum of its proper divisors (130736303).
6050610001 is a wasteful number, since it uses less digits than its factorization.
6050610001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41711.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 6050610001 is about 77785.6670666261. The cubic root of 6050610001 is about 1822.2154320820.
Adding to 6050610001 its reverse (1000160506), we get a palindrome (7050770507).
It can be divided in two parts, 60506 and 10001, that added together give a palindrome (70507).
The spelling of 6050610001 in words is "six billion, fifty million, six hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •