Base | Representation |
---|---|
bin | 101011101100011100000… |
… | …0101110110010001000011 |
3 | 210021002202001110120221110 |
4 | 1113120320011312101003 |
5 | 1241342331131240044 |
6 | 20434444342454403 |
7 | 1156604031063531 |
oct | 127307005662103 |
9 | 23232661416843 |
10 | 6005305336899 |
11 | 1a05921339600 |
12 | 80ba50734403 |
13 | 3473b45376bb |
14 | 16a930653151 |
15 | a6329b046b9 |
hex | 57638176443 |
6005305336899 has 48 divisors (see below), whose sum is σ = 8856812676096. Its totient is φ = 3616580858880.
The previous prime is 6005305336871. The next prime is 6005305336909. The reversal of 6005305336899 is 9986335035006.
It is not a de Polignac number, because 6005305336899 - 232 = 6001010369603 is a prime.
It is a super-2 number, since 2×60053053368992 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (6005305331899) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 202641187 + ... + 202670819.
It is an arithmetic number, because the mean of its divisors is an integer number (184516930752).
Almost surely, 26005305336899 is an apocalyptic number.
6005305336899 is a deficient number, since it is larger than the sum of its proper divisors (2851507339197).
6005305336899 is a wasteful number, since it uses less digits than its factorization.
6005305336899 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33168 (or 33157 counting only the distinct ones).
The product of its (nonzero) digits is 15746400, while the sum is 57.
Multiplying 6005305336899 by its sum of digits (57), we get a palindrome (342302404203243).
The spelling of 6005305336899 in words is "six trillion, five billion, three hundred five million, three hundred thirty-six thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •