Base | Representation |
---|---|
bin | 101011111100110010000… |
… | …000111000011101000011 |
3 | 101200201200000012112120121 |
4 | 223330302000320131003 |
5 | 343440332440213443 |
6 | 10231243343121111 |
7 | 431126253532453 |
oct | 53746200703503 |
9 | 11621600175517 |
10 | 3020201101123 |
11 | a6495086aa78 |
12 | 4094032a3197 |
13 | 18ba5aa8908b |
14 | a626dba9d63 |
15 | 53867e854ed |
hex | 2bf32038743 |
3020201101123 has 2 divisors, whose sum is σ = 3020201101124. Its totient is φ = 3020201101122.
The previous prime is 3020201101019. The next prime is 3020201101139. The reversal of 3020201101123 is 3211011020203.
It is an a-pointer prime, because the next prime (3020201101139) can be obtained adding 3020201101123 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3020201101123 - 225 = 3020167546691 is a prime.
It is a super-2 number, since 2×30202011011232 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020201101097 and 3020201101106.
It is not a weakly prime, because it can be changed into another prime (3020201101523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510100550561 + 1510100550562.
It is an arithmetic number, because the mean of its divisors is an integer number (1510100550562).
Almost surely, 23020201101123 is an apocalyptic number.
3020201101123 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020201101123 is an equidigital number, since it uses as much as digits as its factorization.
3020201101123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3020201101123 its reverse (3211011020203), we get a palindrome (6231212121326).
The spelling of 3020201101123 in words is "three trillion, twenty billion, two hundred one million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •