Base | Representation |
---|---|
bin | 10010111110111011011… |
… | …11000100001001001000 |
3 | 2022100121010120110111002 |
4 | 21133131233010021020 |
5 | 41141312100223133 |
6 | 1215351050554132 |
7 | 65060420626454 |
oct | 11373557041110 |
9 | 2270533513432 |
10 | 652260164168 |
11 | 231692949418 |
12 | a64b4738948 |
13 | 4967aa35482 |
14 | 237d8c33664 |
15 | 11e77d65ce8 |
hex | 97ddbc4248 |
652260164168 has 12 divisors (see below), whose sum is σ = 1222992090915. Its totient is φ = 326128939928.
The previous prime is 652260164147. The next prime is 652260164183. The reversal of 652260164168 is 861461062256.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
652260164168 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 326130082084 + 326130082084 = 571078^2 + 571078^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=571078.
It is a super-2 number, since 2×6522601641682 (a number of 24 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 2 ways as a sum of consecutive naturals, for example, 2141543 + ... + 2427081.
Almost surely, 2652260164168 is an apocalyptic number.
It is an amenable number.
652260164168 is a deficient number, since it is larger than the sum of its proper divisors (570731926747).
652260164168 is an frugal number, since it uses more digits than its factorization.
652260164168 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 571084 (or 285541 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 47.
The spelling of 652260164168 in words is "six hundred fifty-two billion, two hundred sixty million, one hundred sixty-four thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •