Base | Representation |
---|---|
bin | 10111010000111111000110… |
… | …001101100010100111010111 |
3 | 111102021220211012102120012101 |
4 | 113100333012031202213113 |
5 | 101402422113310043111 |
6 | 1001342121410502531 |
7 | 30360354520562230 |
oct | 2720770615424727 |
9 | 442256735376171 |
10 | 102322331331031 |
11 | 2a66a725553839 |
12 | b586905894a47 |
13 | 4512c53ba8756 |
14 | 1b3a5da592087 |
15 | bc698a6d6bc1 |
hex | 5d0fc63629d7 |
102322331331031 has 16 divisors (see below), whose sum is σ = 118254455020800. Its totient is φ = 86718881544768.
The previous prime is 102322331331019. The next prime is 102322331331041. The reversal of 102322331331031 is 130133133223201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102322331331031 - 215 = 102322331298263 is a prime.
It is a super-2 number, since 2×1023223313310312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102322331331041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129476016 + ... + 130263898.
It is an arithmetic number, because the mean of its divisors is an integer number (7390903438800).
Almost surely, 2102322331331031 is an apocalyptic number.
102322331331031 is a deficient number, since it is larger than the sum of its proper divisors (15932123689769).
102322331331031 is an equidigital number, since it uses as much as digits as its factorization.
102322331331031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 996438.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 102322331331031 its reverse (130133133223201), we get a palindrome (232455464554232).
The spelling of 102322331331031 in words is "one hundred two trillion, three hundred twenty-two billion, three hundred thirty-one million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •