Base | Representation |
---|---|
bin | 111101110000100… |
… | …0100000110001111 |
3 | 12100102022222022101 |
4 | 1323201010012033 |
5 | 13220444440403 |
6 | 541343455531 |
7 | 102231651136 |
oct | 17341040617 |
9 | 5312288271 |
10 | 2072265103 |
11 | 973815497 |
12 | 499bb75a7 |
13 | 270429b8c |
14 | 15930a91d |
15 | c1dd971d |
hex | 7b84418f |
2072265103 has 4 divisors (see below), whose sum is σ = 2084243688. Its totient is φ = 2060286520.
The previous prime is 2072265101. The next prime is 2072265121. The reversal of 2072265103 is 3015622702.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3015622702 = 2 ⋅1507811351.
It is a cyclic number.
It is not a de Polignac number, because 2072265103 - 21 = 2072265101 is a prime.
It is a super-2 number, since 2×20722651032 = 8588565314223201218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2072265101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5989033 + ... + 5989378.
It is an arithmetic number, because the mean of its divisors is an integer number (521060922).
Almost surely, 22072265103 is an apocalyptic number.
2072265103 is a deficient number, since it is larger than the sum of its proper divisors (11978585).
2072265103 is a wasteful number, since it uses less digits than its factorization.
2072265103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11978584.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 2072265103 is about 45522.1386031017. The cubic root of 2072265103 is about 1274.9165862128.
Adding to 2072265103 its reverse (3015622702), we get a palindrome (5087887805).
The spelling of 2072265103 in words is "two billion, seventy-two million, two hundred sixty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •