Base | Representation |
---|---|
bin | 110010010000110101100… |
… | …000000100001001110100 |
3 | 110020012111202220101110000 |
4 | 302100311200010021310 |
5 | 423042344113212202 |
6 | 11202434054431300 |
7 | 504355416442656 |
oct | 62206540041164 |
9 | 13205452811400 |
10 | 3454051304052 |
11 | 1111944a06898 |
12 | 479502962530 |
13 | 1c093c35349b |
14 | bd2698966d6 |
15 | 5ecab4dd91c |
hex | 32435804274 |
3454051304052 has 60 divisors (see below), whose sum is σ = 9030944655040. Its totient is φ = 1151175459024.
The previous prime is 3454051304047. The next prime is 3454051304087. The reversal of 3454051304052 is 2504031504543.
3454051304052 is a `hidden beast` number, since 3 + 4 + 54 + 0 + 513 + 0 + 40 + 52 = 666.
It is a super-2 number, since 2×34540513040522 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 3454051303998 and 3454051304016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1333899 + ... + 2947437.
Almost surely, 23454051304052 is an apocalyptic number.
It is an amenable number.
3454051304052 is an abundant number, since it is smaller than the sum of its proper divisors (5576893350988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3454051304052 is a wasteful number, since it uses less digits than its factorization.
3454051304052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620162 (or 1620151 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
Adding to 3454051304052 its reverse (2504031504543), we get a palindrome (5958082808595).
The spelling of 3454051304052 in words is "three trillion, four hundred fifty-four billion, fifty-one million, three hundred four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •