Base | Representation |
---|---|
bin | 101101110110001000101… |
… | …100010000101011101011 |
3 | 102011012000001201111210001 |
4 | 231312020230100223223 |
5 | 403104213102111021 |
6 | 10411153253403431 |
7 | 443421301654051 |
oct | 55661054205353 |
9 | 12135001644701 |
10 | 3150504332011 |
11 | 100513761aa43 |
12 | 42a709639577 |
13 | 19b12572016a |
14 | ac6b164a1d1 |
15 | 56e42745091 |
hex | 2dd88b10aeb |
3150504332011 has 4 divisors (see below), whose sum is σ = 3150509637352. Its totient is φ = 3150499026672.
The previous prime is 3150504331981. The next prime is 3150504332023. The reversal of 3150504332011 is 1102334050513.
It is a happy number.
3150504332011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3150504332011 - 27 = 3150504331883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3150504332081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1630665 + ... + 2993338.
It is an arithmetic number, because the mean of its divisors is an integer number (787627409338).
Almost surely, 23150504332011 is an apocalyptic number.
3150504332011 is a deficient number, since it is larger than the sum of its proper divisors (5305341).
3150504332011 is an equidigital number, since it uses as much as digits as its factorization.
3150504332011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5305340.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 3150504332011 its reverse (1102334050513), we get a palindrome (4252838382524).
The spelling of 3150504332011 in words is "three trillion, one hundred fifty billion, five hundred four million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •