Base | Representation |
---|---|
bin | 10111011011001010101110… |
… | …011000001010110001010001 |
3 | 111111202210211002102012211022 |
4 | 113123022232120022301101 |
5 | 102000403034322224014 |
6 | 1003035354125125225 |
7 | 30462044322013643 |
oct | 2733125630126121 |
9 | 444683732365738 |
10 | 103022011133009 |
11 | 2a90a431562971 |
12 | b67a4330b9815 |
13 | 4563c1abc52b7 |
14 | 1b62413146893 |
15 | bd9c8b5e0a8e |
hex | 5db2ae60ac51 |
103022011133009 has 2 divisors, whose sum is σ = 103022011133010. Its totient is φ = 103022011133008.
The previous prime is 103022011132987. The next prime is 103022011133017. The reversal of 103022011133009 is 900331110220301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82751260819984 + 20270750313025 = 9096772^2 + 4502305^2 .
It is a cyclic number.
It is not a de Polignac number, because 103022011133009 - 28 = 103022011132753 is a prime.
It is a super-2 number, since 2×1030220111330092 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103022011133029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51511005566504 + 51511005566505.
It is an arithmetic number, because the mean of its divisors is an integer number (51511005566505).
Almost surely, 2103022011133009 is an apocalyptic number.
It is an amenable number.
103022011133009 is a deficient number, since it is larger than the sum of its proper divisors (1).
103022011133009 is an equidigital number, since it uses as much as digits as its factorization.
103022011133009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 103022011133009 in words is "one hundred three trillion, twenty-two billion, eleven million, one hundred thirty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •