Base | Representation |
---|---|
bin | 101100100100110000010… |
… | …100010011011111010011 |
3 | 101211211110021000220212001 |
4 | 230210300110103133103 |
5 | 400141233302423443 |
6 | 10303102353414431 |
7 | 434206012022500 |
oct | 54446024233723 |
9 | 11754407026761 |
10 | 3063122311123 |
11 | a81076764356 |
12 | 4157a156a417 |
13 | 192b0b0c7464 |
14 | a83823104a7 |
15 | 54a2b14ad4d |
hex | 2c9305137d3 |
3063122311123 has 12 divisors (see below), whose sum is σ = 3678166621632. Its totient is φ = 2540838782160.
The previous prime is 3063122311043. The next prime is 3063122311129. The reversal of 3063122311123 is 3211132213603.
It is not a de Polignac number, because 3063122311123 - 221 = 3063120213971 is a prime.
It is a super-2 number, since 2×30631223111232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3063122311091 and 3063122311100.
It is not an unprimeable number, because it can be changed into a prime (3063122311129) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1008267840 + ... + 1008270877.
It is an arithmetic number, because the mean of its divisors is an integer number (306513885136).
Almost surely, 23063122311123 is an apocalyptic number.
3063122311123 is a deficient number, since it is larger than the sum of its proper divisors (615044310509).
3063122311123 is a wasteful number, since it uses less digits than its factorization.
3063122311123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2016538762 (or 2016538755 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 3063122311123 its reverse (3211132213603), we get a palindrome (6274254524726).
The spelling of 3063122311123 in words is "three trillion, sixty-three billion, one hundred twenty-two million, three hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •