Base | Representation |
---|---|
bin | 101100100110000000101… |
… | …111101001010001111110 |
3 | 101211221221022001201102120 |
4 | 230212000233221101332 |
5 | 400202014220434200 |
6 | 10303444314503410 |
7 | 434254315200324 |
oct | 54460057512176 |
9 | 11757838051376 |
10 | 3064471655550 |
11 | a816a93a4838 |
12 | 415ab9434b66 |
13 | 192c9481b306 |
14 | a846d5d7d14 |
15 | 54aa98369a0 |
hex | 2c980be947e |
3064471655550 has 48 divisors (see below), whose sum is σ = 7696090871040. Its totient is φ = 806848230240.
The previous prime is 3064471655527. The next prime is 3064471655579. The reversal of 3064471655550 is 555561744603.
It is a happy number.
3064471655550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3064471655493 and 3064471655502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 129290752 + ... + 129314451.
It is an arithmetic number, because the mean of its divisors is an integer number (160335226480).
Almost surely, 23064471655550 is an apocalyptic number.
3064471655550 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3064471655550 is an abundant number, since it is smaller than the sum of its proper divisors (4631619215490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3064471655550 is a wasteful number, since it uses less digits than its factorization.
3064471655550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258605297 (or 258605292 counting only the distinct ones).
The product of its (nonzero) digits is 7560000, while the sum is 51.
The spelling of 3064471655550 in words is "three trillion, sixty-four billion, four hundred seventy-one million, six hundred fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •