Base | Representation |
---|---|
bin | 101101100101111101010… |
… | …111110000110111010001 |
3 | 102002112011112101122220221 |
4 | 231211331113300313101 |
5 | 402313124420241431 |
6 | 10355201522433041 |
7 | 442234665114526 |
oct | 55457527606721 |
9 | 12075145348827 |
10 | 3133134540241 |
11 | aa8833849332 |
12 | 427280502781 |
13 | 1995b7c34174 |
14 | ab9047cb14d |
15 | 56777875111 |
hex | 2d97d5f0dd1 |
3133134540241 has 8 divisors (see below), whose sum is σ = 3141936461664. Its totient is φ = 3124344210240.
The previous prime is 3133134540227. The next prime is 3133134540251. The reversal of 3133134540241 is 1420454313313.
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 3133134540241 - 27 = 3133134540113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3133134540197 and 3133134540206.
It is not an unprimeable number, because it can be changed into a prime (3133134540251) 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, 2356360 + ... + 3437833.
It is an arithmetic number, because the mean of its divisors is an integer number (392742057708).
Almost surely, 23133134540241 is an apocalyptic number.
It is an amenable number.
3133134540241 is a deficient number, since it is larger than the sum of its proper divisors (8801921423).
3133134540241 is an equidigital number, since it uses as much as digits as its factorization.
3133134540241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5795711.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 3133134540241 its reverse (1420454313313), we get a palindrome (4553588853554).
The spelling of 3133134540241 in words is "three trillion, one hundred thirty-three billion, one hundred thirty-four million, five hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •