Base | Representation |
---|---|
bin | 1101001010001100… |
… | …10100110101101000 |
3 | 200020100210101102100 |
4 | 12211012110311220 |
5 | 103432101204102 |
6 | 3125012333400 |
7 | 340034241261 |
oct | 64506246550 |
9 | 20210711370 |
10 | 7064866152 |
11 | 2aa5a29563 |
12 | 1452014260 |
13 | 887897a96 |
14 | 4b0403968 |
15 | 2b537da1c |
hex | 1a5194d68 |
7064866152 has 24 divisors (see below), whose sum is σ = 19134012690. Its totient is φ = 2354955360.
The previous prime is 7064866091. The next prime is 7064866153. The reversal of 7064866152 is 2516684607.
It can be written as a sum of positive squares in only one way, i.e., 5543398116 + 1521468036 = 74454^2 + 39006^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 7064866098 and 7064866107.
It is not an unprimeable number, because it can be changed into a prime (7064866153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 49061499 + ... + 49061642.
Almost surely, 27064866152 is an apocalyptic number.
7064866152 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
7064866152 is an abundant number, since it is smaller than the sum of its proper divisors (12069146538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7064866152 is a wasteful number, since it uses less digits than its factorization.
7064866152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98123153 (or 98123146 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The square root of 7064866152 is about 84052.7581462976. The cubic root of 7064866152 is about 1918.8218097144.
The spelling of 7064866152 in words is "seven billion, sixty-four million, eight hundred sixty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •