Base | Representation |
---|---|
bin | 110100100110001001110011… |
… | …001111010100010010110101 |
3 | 1010100001000002011212210111011 |
4 | 310212021303033110102311 |
5 | 220304422414144214333 |
6 | 2135551023122312221 |
7 | 66503224142030164 |
oct | 6446116317242265 |
9 | 1110030064783434 |
10 | 231320282023093 |
11 | 6778442077074a |
12 | 21b3b5064b8671 |
13 | 9c0c541745653 |
14 | 4119d660953db |
15 | 1bb22886669cd |
hex | d262733d44b5 |
231320282023093 has 2 divisors, whose sum is σ = 231320282023094. Its totient is φ = 231320282023092.
The previous prime is 231320282023063. The next prime is 231320282023139. The reversal of 231320282023093 is 390320282023132.
231320282023093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157452479672049 + 73867802351044 = 12548007^2 + 8594638^2 .
It is a cyclic number.
It is not a de Polignac number, because 231320282023093 - 237 = 231182843069621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231320282023013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115660141011546 + 115660141011547.
It is an arithmetic number, because the mean of its divisors is an integer number (115660141011547).
Almost surely, 2231320282023093 is an apocalyptic number.
It is an amenable number.
231320282023093 is a deficient number, since it is larger than the sum of its proper divisors (1).
231320282023093 is an equidigital number, since it uses as much as digits as its factorization.
231320282023093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624, while the sum is 40.
The spelling of 231320282023093 in words is "two hundred thirty-one trillion, three hundred twenty billion, two hundred eighty-two million, twenty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •