Base | Representation |
---|---|
bin | 10111010100010111110110… |
… | …001010010001110010000001 |
3 | 111110010011112202000221010100 |
4 | 113110113312022101302001 |
5 | 101420230232342003001 |
6 | 1002041051311553013 |
7 | 30413234043011532 |
oct | 2724276612216201 |
9 | 443104482027110 |
10 | 102555064016001 |
11 | 2a74a3a40396a3 |
12 | b603a3752b769 |
13 | 452bb9377b56c |
14 | 1b479979bc689 |
15 | bcca5c624586 |
hex | 5d45f6291c81 |
102555064016001 has 12 divisors (see below), whose sum is σ = 148135202102628. Its totient is φ = 68369992076544.
The previous prime is 102555064015981. The next prime is 102555064016051. The reversal of 102555064016001 is 100610460555201.
102555064016001 is a `hidden beast` number, since 1 + 0 + 2 + 5 + 5 + 5 + 0 + 6 + 40 + 1 + 600 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 48780781736976 + 53774282279025 = 6984324^2 + 7333095^2 .
It is not a de Polignac number, because 102555064016001 - 233 = 102546474081409 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102555064016051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11835541 + ... + 18579293.
It is an arithmetic number, because the mean of its divisors is an integer number (12344600175219).
Almost surely, 2102555064016001 is an apocalyptic number.
It is an amenable number.
102555064016001 is a deficient number, since it is larger than the sum of its proper divisors (45580138086627).
102555064016001 is a wasteful number, since it uses less digits than its factorization.
102555064016001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8433472 (or 8433469 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 102555064016001 in words is "one hundred two trillion, five hundred fifty-five billion, sixty-four million, sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •