Base | Representation |
---|---|
bin | 1001011100100010110000011… |
… | …0000011101001100111101111 |
3 | 10020011111220100222111201201120 |
4 | 2113020230012003221213233 |
5 | 1144110434423031013210 |
6 | 10313411535113512023 |
7 | 260003100212461533 |
oct | 22710540603514757 |
9 | 3204456328451646 |
10 | 664702125251055 |
11 | 182881651a56941 |
12 | 62673884a12613 |
13 | 226b81aba0cb78 |
14 | ba1da7c589bc3 |
15 | 51ca663687270 |
hex | 25c8b060e99ef |
664702125251055 has 32 divisors (see below), whose sum is σ = 1078898663900160. Its totient is φ = 349398653485440.
The previous prime is 664702125250993. The next prime is 664702125251093. The reversal of 664702125251055 is 550152521207466.
664702125251055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 664702125251055 - 211 = 664702125249007 is a prime.
It is a super-2 number, since 2×6647021252510552 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 664702125250989 and 664702125251007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 497494536 + ... + 498828845.
It is an arithmetic number, because the mean of its divisors is an integer number (33715583246880).
Almost surely, 2664702125251055 is an apocalyptic number.
664702125251055 is a deficient number, since it is larger than the sum of its proper divisors (414196538649105).
664702125251055 is a wasteful number, since it uses less digits than its factorization.
664702125251055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996324031.
The product of its (nonzero) digits is 5040000, while the sum is 51.
The spelling of 664702125251055 in words is "six hundred sixty-four trillion, seven hundred two billion, one hundred twenty-five million, two hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •