Base | Representation |
---|---|
bin | 101101100110011011011… |
… | …111111101001010011101 |
3 | 102002120110202111220012021 |
4 | 231212123133331022131 |
5 | 402320143320114003 |
6 | 10355324020340141 |
7 | 442253343356533 |
oct | 55463337751235 |
9 | 12076422456167 |
10 | 3133640004253 |
11 | aa8a730a7990 |
12 | 4273a1844651 |
13 | 1996688802b5 |
14 | ab9519a6153 |
15 | 567a6e1c2bd |
hex | 2d99b7fd29d |
3133640004253 has 8 divisors (see below), whose sum is σ = 3444611914656. Its totient is φ = 2827017351600.
The previous prime is 3133640004251. The next prime is 3133640004421. The reversal of 3133640004253 is 3524000463313.
3133640004253 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3133640004253 - 21 = 3133640004251 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3133640004251) 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, 1087312926 + ... + 1087315807.
It is an arithmetic number, because the mean of its divisors is an integer number (430576489332).
Almost surely, 23133640004253 is an apocalyptic number.
It is an amenable number.
3133640004253 is a deficient number, since it is larger than the sum of its proper divisors (310971910403).
3133640004253 is a wasteful number, since it uses less digits than its factorization.
3133640004253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2174628875.
The product of its (nonzero) digits is 77760, while the sum is 34.
Adding to 3133640004253 its reverse (3524000463313), we get a palindrome (6657640467566).
The spelling of 3133640004253 in words is "three trillion, one hundred thirty-three billion, six hundred forty million, four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •