Base | Representation |
---|---|
bin | 101100011010100111001… |
… | …111011011100001000000 |
3 | 101210210100100011022002011 |
4 | 230122213033123201000 |
5 | 400001433022320341 |
6 | 10254102025502304 |
7 | 433342112126242 |
oct | 54324717334100 |
9 | 11723310138064 |
10 | 3052232620096 |
11 | a77498819300 |
12 | 413662641994 |
13 | 191a93cb29ba |
14 | a7a2bd56092 |
15 | 545e00eab81 |
hex | 2c6a73db840 |
3052232620096 has 63 divisors (see below), whose sum is σ = 6657781271533. Its totient is φ = 1387308581120.
The previous prime is 3052232620079. The next prime is 3052232620123. The reversal of 3052232620096 is 6900262322503.
The square root of 3052232620096 is 1747064.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 494996673600 + 2557235946496 = 703560^2 + 1599136^2 .
It is a super-2 number, since 2×30522326200962 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 153731706 + ... + 153751558.
Almost surely, 23052232620096 is an apocalyptic number.
3052232620096 is the 1747064-th square number.
It is an amenable number.
3052232620096 is an abundant number, since it is smaller than the sum of its proper divisors (3605548651437).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3052232620096 is an frugal number, since it uses more digits than its factorization.
3052232620096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39740 (or 19866 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 40.
Adding to 3052232620096 its reverse (6900262322503), we get a palindrome (9952494942599).
The spelling of 3052232620096 in words is "three trillion, fifty-two billion, two hundred thirty-two million, six hundred twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •