Base | Representation |
---|---|
bin | 110000010110010001100… |
… | …001100001000000000110 |
3 | 102202121211100002112112020 |
4 | 300112101201201000012 |
5 | 413413340001431204 |
6 | 11022151335504010 |
7 | 462016303152135 |
oct | 60262141410006 |
9 | 12677740075466 |
10 | 3322451202054 |
11 | 10710530a6416 |
12 | 457ab6228006 |
13 | 1b13c8b0b64a |
14 | b6b43aab91c |
15 | 5b657e5abd9 |
hex | 30591861006 |
3322451202054 has 8 divisors (see below), whose sum is σ = 6644902404120. Its totient is φ = 1107483734016.
The previous prime is 3322451202013. The next prime is 3322451202107. The reversal of 3322451202054 is 4502021542233.
It is a sphenic number, since it is the product of 3 distinct primes.
3322451202054 is an admirable number.
It is a super-2 number, since 2×33224512020542 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 276870933499 + ... + 276870933510.
It is an arithmetic number, because the mean of its divisors is an integer number (830612800515).
Almost surely, 23322451202054 is an apocalyptic number.
3322451202054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3322451202054 is a wasteful number, since it uses less digits than its factorization.
3322451202054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553741867014.
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 3322451202054 its reverse (4502021542233), we get a palindrome (7824472744287).
The spelling of 3322451202054 in words is "three trillion, three hundred twenty-two billion, four hundred fifty-one million, two hundred two thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •