Base | Representation |
---|---|
bin | 1001001001000101010101… |
… | …10101111110000111000001 |
3 | 2122011212011110111212100112 |
4 | 10210202222311332013001 |
5 | 10113333041141020113 |
6 | 110431200135001105 |
7 | 4143262561633001 |
oct | 444425265760701 |
9 | 78155143455315 |
10 | 20103313220033 |
11 | 645084924740a |
12 | 23081a6b09195 |
13 | b2a971353bb4 |
14 | 4d701133a001 |
15 | 24cdeedd55a8 |
hex | 1248aad7e1c1 |
20103313220033 has 2 divisors, whose sum is σ = 20103313220034. Its totient is φ = 20103313220032.
The previous prime is 20103313220027. The next prime is 20103313220083. The reversal of 20103313220033 is 33002231330102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20103099387904 + 213832129 = 4483648^2 + 14623^2 .
It is a cyclic number.
It is not a de Polignac number, because 20103313220033 - 210 = 20103313219009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20103313219990 and 20103313220008.
It is not a weakly prime, because it can be changed into another prime (20103313220083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051656610016 + 10051656610017.
It is an arithmetic number, because the mean of its divisors is an integer number (10051656610017).
Almost surely, 220103313220033 is an apocalyptic number.
It is an amenable number.
20103313220033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20103313220033 is an equidigital number, since it uses as much as digits as its factorization.
20103313220033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 20103313220033 its reverse (33002231330102), we get a palindrome (53105544550135).
The spelling of 20103313220033 in words is "twenty trillion, one hundred three billion, three hundred thirteen million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •