Base | Representation |
---|---|
bin | 101100100110000101000… |
… | …001111101010100001000 |
3 | 101211222010022101002201220 |
4 | 230212011001331110020 |
5 | 400202141123040224 |
6 | 10303455404042040 |
7 | 434256150336132 |
oct | 54460501752410 |
9 | 11758108332656 |
10 | 3064543565064 |
11 | a81735a4a493 |
12 | 415b19533320 |
13 | 192ca66a8017 |
14 | a8478d96052 |
15 | 54ab0cdd279 |
hex | 2c98507d508 |
3064543565064 has 64 divisors (see below), whose sum is σ = 8013541939200. Its totient is φ = 974768790336.
The previous prime is 3064543565059. The next prime is 3064543565117. The reversal of 3064543565064 is 4605653454603.
It is a junction number, because it is equal to n+sod(n) for n = 3064543564998 and 3064543565016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6393664 + ... + 6856239.
It is an arithmetic number, because the mean of its divisors is an integer number (125211592800).
Almost surely, 23064543565064 is an apocalyptic number.
It is an amenable number.
3064543565064 is an abundant number, since it is smaller than the sum of its proper divisors (4948998374136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3064543565064 is a wasteful number, since it uses less digits than its factorization.
3064543565064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13250354 (or 13250350 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 51.
The spelling of 3064543565064 in words is "three trillion, sixty-four billion, five hundred forty-three million, five hundred sixty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •