Base | Representation |
---|---|
bin | 1011100011010001… |
… | …00000110110111011 |
3 | 121000012001102102212 |
4 | 11301220200312323 |
5 | 100200030204201 |
6 | 2503205445335 |
7 | 306451066301 |
oct | 56150406673 |
9 | 17005042385 |
10 | 6201413051 |
11 | 26a2599459 |
12 | 1250a1084b |
13 | 77aa292a2 |
14 | 42b87c271 |
15 | 264670abb |
hex | 171a20dbb |
6201413051 has 8 divisors (see below), whose sum is σ = 6567465744. Its totient is φ = 5835500800.
The previous prime is 6201413047. The next prime is 6201413069. The reversal of 6201413051 is 1503141026.
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 6201413051 - 22 = 6201413047 is a prime.
It is a super-2 number, since 2×62014130512 = 76915047658226257202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6201413081) 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, 63791 + ... + 128343.
It is an arithmetic number, because the mean of its divisors is an integer number (820933218).
Almost surely, 26201413051 is an apocalyptic number.
6201413051 is a deficient number, since it is larger than the sum of its proper divisors (366052693).
6201413051 is a wasteful number, since it uses less digits than its factorization.
6201413051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70221.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 6201413051 is about 78749.0511117436. The cubic root of 6201413051 is about 1837.2301040708.
Adding to 6201413051 its reverse (1503141026), we get a palindrome (7704554077).
The spelling of 6201413051 in words is "six billion, two hundred one million, four hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •