Base | Representation |
---|---|
bin | 10111001111100010110111… |
… | …100010111001000101110111 |
3 | 111101221110012121102121222122 |
4 | 113033202313202321011313 |
5 | 101344311310030201241 |
6 | 1001224423003350155 |
7 | 30350250460051265 |
oct | 2717426742710567 |
9 | 441843177377878 |
10 | 102223301022071 |
11 | 2a63172751a999 |
12 | b56b68882235b |
13 | 45068012536b8 |
14 | 1b358c422d435 |
15 | bc40e169304b |
hex | 5cf8b78b9177 |
102223301022071 has 2 divisors, whose sum is σ = 102223301022072. Its totient is φ = 102223301022070.
The previous prime is 102223301022067. The next prime is 102223301022119. The reversal of 102223301022071 is 170220103322201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102223301022071 - 22 = 102223301022067 is a prime.
It is a super-3 number, since 3×1022233010220713 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102223301022071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102223301022571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51111650511035 + 51111650511036.
It is an arithmetic number, because the mean of its divisors is an integer number (51111650511036).
Almost surely, 2102223301022071 is an apocalyptic number.
102223301022071 is a deficient number, since it is larger than the sum of its proper divisors (1).
102223301022071 is an equidigital number, since it uses as much as digits as its factorization.
102223301022071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 102223301022071 its reverse (170220103322201), we get a palindrome (272443404344272).
The spelling of 102223301022071 in words is "one hundred two trillion, two hundred twenty-three billion, three hundred one million, twenty-two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •