Base | Representation |
---|---|
bin | 101100110001101111011… |
… | …100001010000111011000 |
3 | 101220011110000222201100002 |
4 | 230301233130022013120 |
5 | 400403312424031001 |
6 | 10313330144232132 |
7 | 435211366313006 |
oct | 54615734120730 |
9 | 11804400881302 |
10 | 3077066236376 |
11 | a86a81742820 |
12 | 41843330b648 |
13 | 194220c01bc2 |
14 | a8d0618ba76 |
15 | 550953a446b |
hex | 2cc6f70a1d8 |
3077066236376 has 32 divisors (see below), whose sum is σ = 6294078362880. Its totient is φ = 1398648861600.
The previous prime is 3077066236331. The next prime is 3077066236417. The reversal of 3077066236376 is 6736326607703.
3077066236376 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×30770662363762 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8983085 + ... + 9319331.
It is an arithmetic number, because the mean of its divisors is an integer number (196689948840).
Almost surely, 23077066236376 is an apocalyptic number.
It is an amenable number.
3077066236376 is an abundant number, since it is smaller than the sum of its proper divisors (3217012126504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3077066236376 is a wasteful number, since it uses less digits than its factorization.
3077066236376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440255 (or 440251 counting only the distinct ones).
The product of its (nonzero) digits is 24004512, while the sum is 56.
The spelling of 3077066236376 in words is "three trillion, seventy-seven billion, sixty-six million, two hundred thirty-six thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •