Base | Representation |
---|---|
bin | 101100011100011101001… |
… | …110010111000010111110 |
3 | 101210222110021210210222211 |
4 | 230130131032113002332 |
5 | 400020011241114014 |
6 | 10255030255531034 |
7 | 433442136042226 |
oct | 54343516270276 |
9 | 11728407723884 |
10 | 3054212051134 |
11 | a78314097122 |
12 | 413b15529a7a |
13 | 19201b10797a |
14 | a7b78bb9086 |
15 | 546a8c98cc4 |
hex | 2c71d3970be |
3054212051134 has 8 divisors (see below), whose sum is σ = 4592200068648. Its totient is φ = 1523478694920.
The previous prime is 3054212051131. The next prime is 3054212051207. The reversal of 3054212051134 is 4311502124503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×30542120511342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3054212051096 and 3054212051105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3054212051131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1813664272 + ... + 1813665955.
It is an arithmetic number, because the mean of its divisors is an integer number (574025008581).
Almost surely, 23054212051134 is an apocalyptic number.
3054212051134 is a deficient number, since it is larger than the sum of its proper divisors (1537988017514).
3054212051134 is a wasteful number, since it uses less digits than its factorization.
3054212051134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3627330650.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 3054212051134 its reverse (4311502124503), we get a palindrome (7365714175637).
The spelling of 3054212051134 in words is "three trillion, fifty-four billion, two hundred twelve million, fifty-one thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •