Base | Representation |
---|---|
bin | 10111010000111111000101… |
… | …101101111000001110111101 |
3 | 111102021220210121210212122211 |
4 | 113100333011231320032331 |
5 | 101402422104143442343 |
6 | 1001342120512540421 |
7 | 30360354360202633 |
oct | 2720770555701675 |
9 | 442256717725584 |
10 | 102322323030973 |
11 | 2a66a7208a4891 |
12 | b586902b51711 |
13 | 4512c52260886 |
14 | 1b3a5d9431353 |
15 | bc6989ae779d |
hex | 5d0fc5b783bd |
102322323030973 has 2 divisors, whose sum is σ = 102322323030974. Its totient is φ = 102322323030972.
The previous prime is 102322323030929. The next prime is 102322323031067. The reversal of 102322323030973 is 379030323223201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101217221698329 + 1105101332644 = 10060677^2 + 1051238^2 .
It is a cyclic number.
It is not a de Polignac number, because 102322323030973 - 225 = 102322289476541 is a prime.
It is a super-3 number, since 3×1023223230309733 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102322323030173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51161161515486 + 51161161515487.
It is an arithmetic number, because the mean of its divisors is an integer number (51161161515487).
Almost surely, 2102322323030973 is an apocalyptic number.
It is an amenable number.
102322323030973 is a deficient number, since it is larger than the sum of its proper divisors (1).
102322323030973 is an equidigital number, since it uses as much as digits as its factorization.
102322323030973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 244944, while the sum is 40.
The spelling of 102322323030973 in words is "one hundred two trillion, three hundred twenty-two billion, three hundred twenty-three million, thirty thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •