Base | Representation |
---|---|
bin | 111110000111000010110… |
… | …000101010100011001001 |
3 | 120010000220002222100022121 |
4 | 332013002300222203021 |
5 | 1024412203013441100 |
6 | 13024434213051241 |
7 | 620236142632462 |
oct | 76070260524311 |
9 | 16100802870277 |
10 | 4268170062025 |
11 | 13a6136802401 |
12 | 58b249626b21 |
13 | 24c6433bc4cc |
14 | 10a81ada9d69 |
15 | 7605907151a |
hex | 3e1c2c2a8c9 |
4268170062025 has 27 divisors (see below), whose sum is σ = 5346757953589. Its totient is φ = 3379902380000.
The previous prime is 4268170062017. The next prime is 4268170062031. The reversal of 4268170062025 is 5202600718624.
It is a happy number.
The square root of 4268170062025 is 2065955.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 788094736009 + 3480075326016 = 887747^2 + 1865496^2 .
It is not a de Polignac number, because 4268170062025 - 23 = 4268170062017 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1043305230 + ... + 1043309320.
Almost surely, 24268170062025 is an apocalyptic number.
4268170062025 is the 2065955-th square number.
4268170062025 is the 1032978-th centered octagonal number.
It is an amenable number.
4268170062025 is a deficient number, since it is larger than the sum of its proper divisors (1078587891564).
4268170062025 is an frugal number, since it uses more digits than its factorization.
4268170062025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8394 (or 4197 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 4268170062025 in words is "four trillion, two hundred sixty-eight billion, one hundred seventy million, sixty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •