Base | Representation |
---|---|
bin | 101101111000000011100… |
… | …1100010100010110100101 |
3 | 211022202122112110201200210 |
4 | 1123300013030110112211 |
5 | 1311300402430111013 |
6 | 21224312110530033 |
7 | 1220350031221326 |
oct | 133600714242645 |
9 | 24282575421623 |
10 | 6305132660133 |
11 | 2010aa001522a |
12 | 859b88206919 |
13 | 3697576577b8 |
14 | 17b25488644d |
15 | ae027054cc3 |
hex | 5bc073145a5 |
6305132660133 has 8 divisors (see below), whose sum is σ = 8406971898048. Its totient is φ = 4203357597824.
The previous prime is 6305132660111. The next prime is 6305132660147. The reversal of 6305132660133 is 3310662315036.
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 6305132660133 - 224 = 6305115882917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6305132660091 and 6305132660100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6305132660153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15814185 + ... + 16207982.
It is an arithmetic number, because the mean of its divisors is an integer number (1050871487256).
Almost surely, 26305132660133 is an apocalyptic number.
It is an amenable number.
6305132660133 is a deficient number, since it is larger than the sum of its proper divisors (2101839237915).
6305132660133 is a wasteful number, since it uses less digits than its factorization.
6305132660133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32087803.
The product of its (nonzero) digits is 174960, while the sum is 39.
Adding to 6305132660133 its reverse (3310662315036), we get a palindrome (9615794975169).
The spelling of 6305132660133 in words is "six trillion, three hundred five billion, one hundred thirty-two million, six hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •