Base | Representation |
---|---|
bin | 101100001001111100111… |
… | …010010001111001111010 |
3 | 101202002011112212020222120 |
4 | 230021330322101321322 |
5 | 344203313144012300 |
6 | 10241542511502110 |
7 | 432136560141552 |
oct | 54117472217172 |
9 | 11662145766876 |
10 | 3034342563450 |
11 | a6a9482a9a20 |
12 | 4100ab227936 |
13 | 1901a2797a73 |
14 | a6c11d88162 |
15 | 53de470d3a0 |
hex | 2c27ce91e7a |
3034342563450 has 48 divisors (see below), whose sum is σ = 8209275885216. Its totient is φ = 735598196800.
The previous prime is 3034342563419. The next prime is 3034342563463. The reversal of 3034342563450 is 543652434303.
It is a super-3 number, since 3×30343425634503 (a number of 38 digits) contains 333 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 919496097 + ... + 919499396.
It is an arithmetic number, because the mean of its divisors is an integer number (171026580942).
Almost surely, 23034342563450 is an apocalyptic number.
3034342563450 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3034342563450 is an abundant number, since it is smaller than the sum of its proper divisors (5174933321766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3034342563450 is a wasteful number, since it uses less digits than its factorization.
3034342563450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838995519 (or 1838995514 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 42.
Adding to 3034342563450 its reverse (543652434303), we get a palindrome (3577994997753).
The spelling of 3034342563450 in words is "three trillion, thirty-four billion, three hundred forty-two million, five hundred sixty-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •