Base | Representation |
---|---|
bin | 101100100110010100010… |
… | …0000100100101111011101 |
3 | 210200222120012222000010120 |
4 | 1121030220200210233131 |
5 | 1300411404034143013 |
6 | 21011522021025153 |
7 | 1201564102663545 |
oct | 131145040445735 |
9 | 23628505860116 |
10 | 6129597959133 |
11 | 1a53603282300 |
12 | 82bb59b551b9 |
13 | 356031b5a10c |
14 | 172961b22325 |
15 | a96a1883123 |
hex | 59328824bdd |
6129597959133 has 12 divisors (see below), whose sum is σ = 8983322629344. Its totient is φ = 3714907853800.
The previous prime is 6129597959131. The next prime is 6129597959137. The reversal of 6129597959133 is 3319597959216.
It is not a de Polignac number, because 6129597959133 - 21 = 6129597959131 is a prime.
It is a super-2 number, since 2×61295979591332 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6129597959131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8442972033 + ... + 8442972758.
It is an arithmetic number, because the mean of its divisors is an integer number (748610219112).
Almost surely, 26129597959133 is an apocalyptic number.
It is an amenable number.
6129597959133 is a deficient number, since it is larger than the sum of its proper divisors (2853724670211).
6129597959133 is a wasteful number, since it uses less digits than its factorization.
6129597959133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16885944816 (or 16885944805 counting only the distinct ones).
The product of its digits is 124002900, while the sum is 69.
The spelling of 6129597959133 in words is "six trillion, one hundred twenty-nine billion, five hundred ninety-seven million, nine hundred fifty-nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •