Base | Representation |
---|---|
bin | 10111010000110011110011… |
… | …101111001011101111110101 |
3 | 111102020202112110102110222202 |
4 | 113100303303233023233311 |
5 | 101402222302304114333 |
6 | 1001332354533234245 |
7 | 30356445246061145 |
oct | 2720636357135765 |
9 | 442222473373882 |
10 | 102310210223093 |
11 | 2a6655754a3a64 |
12 | b5844a2492985 |
13 | 4511a7191c932 |
14 | 1b39baa84a925 |
15 | bc64cb4e25e8 |
hex | 5d0cf3bcbbf5 |
102310210223093 has 2 divisors, whose sum is σ = 102310210223094. Its totient is φ = 102310210223092.
The previous prime is 102310210222967. The next prime is 102310210223119. The reversal of 102310210223093 is 390322012013201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99581099615089 + 2729110608004 = 9979033^2 + 1652002^2 .
It is a cyclic number.
It is not a de Polignac number, because 102310210223093 - 224 = 102310193445877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102310210223693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51155105111546 + 51155105111547.
It is an arithmetic number, because the mean of its divisors is an integer number (51155105111547).
Almost surely, 2102310210223093 is an apocalyptic number.
It is an amenable number.
102310210223093 is a deficient number, since it is larger than the sum of its proper divisors (1).
102310210223093 is an equidigital number, since it uses as much as digits as its factorization.
102310210223093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 102310210223093 its reverse (390322012013201), we get a palindrome (492632222236294).
The spelling of 102310210223093 in words is "one hundred two trillion, three hundred ten billion, two hundred ten million, two hundred twenty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •