Base | Representation |
---|---|
bin | 10111010001000111001010… |
… | …111001111101111001011001 |
3 | 111102022202012100002121200212 |
4 | 113101013022321331321121 |
5 | 101403042342001124234 |
6 | 1001350113514540505 |
7 | 30361112401326455 |
oct | 2721071271757131 |
9 | 442282170077625 |
10 | 102331000020569 |
11 | 2a673373825571 |
12 | b588524a37735 |
13 | 4513a05b17648 |
14 | 1b3abbd9a3665 |
15 | bc6ce676c5ce |
hex | 5d11cae7de59 |
102331000020569 has 2 divisors, whose sum is σ = 102331000020570. Its totient is φ = 102331000020568.
The previous prime is 102331000020539. The next prime is 102331000020611. The reversal of 102331000020569 is 965020000133201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96770897328400 + 5560102692169 = 9837220^2 + 2357987^2 .
It is an emirp because it is prime and its reverse (965020000133201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102331000020569 is a prime.
It is a super-2 number, since 2×1023310000205692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102331000020539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51165500010284 + 51165500010285.
It is an arithmetic number, because the mean of its divisors is an integer number (51165500010285).
Almost surely, 2102331000020569 is an apocalyptic number.
It is an amenable number.
102331000020569 is a deficient number, since it is larger than the sum of its proper divisors (1).
102331000020569 is an equidigital number, since it uses as much as digits as its factorization.
102331000020569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The spelling of 102331000020569 in words is "one hundred two trillion, three hundred thirty-one billion, twenty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •