Base | Representation |
---|---|
bin | 10111010000110110010001… |
… | …111011000111011000010101 |
3 | 111102021000101102020222202012 |
4 | 113100312101323013120111 |
5 | 101402243221210313221 |
6 | 1001333514140154005 |
7 | 30356601103066364 |
oct | 2720662173073025 |
9 | 442230342228665 |
10 | 102312864151061 |
11 | 2a666707582363 |
12 | b584b03238905 |
13 | 45120a56c4b05 |
14 | 1b39d7d0c97db |
15 | bc65d44c665b |
hex | 5d0d91ec7615 |
102312864151061 has 8 divisors (see below), whose sum is σ = 103754600850648. Its totient is φ = 100879534080000.
The previous prime is 102312864151031. The next prime is 102312864151067. The reversal of 102312864151061 is 160151468213201.
It can be written as a sum of positive squares in 4 ways, for example, as 22424912895025 + 79887951256036 = 4735495^2 + 8938006^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102312864151061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102312864151067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2101632620 + ... + 2101681301.
It is an arithmetic number, because the mean of its divisors is an integer number (12969325106331).
Almost surely, 2102312864151061 is an apocalyptic number.
It is an amenable number.
102312864151061 is a deficient number, since it is larger than the sum of its proper divisors (1441736699587).
102312864151061 is a wasteful number, since it uses less digits than its factorization.
102312864151061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4203314263.
The product of its (nonzero) digits is 69120, while the sum is 41.
The spelling of 102312864151061 in words is "one hundred two trillion, three hundred twelve billion, eight hundred sixty-four million, one hundred fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •