Base | Representation |
---|---|
bin | 100100100000010100110010… |
… | …0011100010011000001111011 |
3 | 1120002221001110120111210122012 |
4 | 1021000221210130103001323 |
5 | 314041413424202420011 |
6 | 3054532123004320135 |
7 | 124430566434141605 |
oct | 11100514434230173 |
9 | 1502831416453565 |
10 | 321102030123131 |
11 | 9334967398a064 |
12 | 3001b88424304b |
13 | 10a22a39c571ba |
14 | 59415c7a18175 |
15 | 271c902508a8b |
hex | 1240a6471307b |
321102030123131 has 2 divisors, whose sum is σ = 321102030123132. Its totient is φ = 321102030123130.
The previous prime is 321102030123037. The next prime is 321102030123139. The reversal of 321102030123131 is 131321030201123.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321102030123131 is a prime.
It is a super-2 number, since 2×3211020301231312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321102030123097 and 321102030123106.
It is not a weakly prime, because it can be changed into another prime (321102030123139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160551015061565 + 160551015061566.
It is an arithmetic number, because the mean of its divisors is an integer number (160551015061566).
Almost surely, 2321102030123131 is an apocalyptic number.
321102030123131 is a deficient number, since it is larger than the sum of its proper divisors (1).
321102030123131 is an equidigital number, since it uses as much as digits as its factorization.
321102030123131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 321102030123131 its reverse (131321030201123), we get a palindrome (452423060324254).
The spelling of 321102030123131 in words is "three hundred twenty-one trillion, one hundred two billion, thirty million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •