Base | Representation |
---|---|
bin | 101101100111011100001… |
… | …000111111011000000001 |
3 | 102002200021100012010212001 |
4 | 231213130020333120001 |
5 | 402324403433044131 |
6 | 10400023401104001 |
7 | 442322252431555 |
oct | 55473410773001 |
9 | 12080240163761 |
10 | 3134724503041 |
11 | aa947a29497a |
12 | 427644a88001 |
13 | 1997ac464461 |
14 | aba15a2b865 |
15 | 5681c240261 |
hex | 2d9dc23f601 |
3134724503041 has 8 divisors (see below), whose sum is σ = 3141797347584. Its totient is φ = 3127659412320.
The previous prime is 3134724503023. The next prime is 3134724503063. The reversal of 3134724503041 is 1403054274313.
3134724503041 is digitally balanced in base 2, 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 a de Polignac number, because none of the positive numbers 2k-3134724503041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3134724503011) 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, 1128601 + ... + 2746486.
It is an arithmetic number, because the mean of its divisors is an integer number (392724668448).
Almost surely, 23134724503041 is an apocalyptic number.
It is an amenable number.
3134724503041 is a deficient number, since it is larger than the sum of its proper divisors (7072844543).
3134724503041 is a wasteful number, since it uses less digits than its factorization.
3134724503041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3876911.
The product of its (nonzero) digits is 120960, while the sum is 37.
Adding to 3134724503041 its reverse (1403054274313), we get a palindrome (4537778777354).
The spelling of 3134724503041 in words is "three trillion, one hundred thirty-four billion, seven hundred twenty-four million, five hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •