Base | Representation |
---|---|
bin | 101111010111001011100001… |
… | …101110111100111101001010 |
3 | 1000022112101120120200101101010 |
4 | 233113023201232330331022 |
5 | 204300301133420301211 |
6 | 2015004113121304350 |
7 | 61606154500425564 |
oct | 5727134156747512 |
9 | 1008471516611333 |
10 | 208301111103306 |
11 | 6040a006901181 |
12 | 1b4421987950b6 |
13 | 8c2c930c4c400 |
14 | 3961b82bd4334 |
15 | 19135caede4a6 |
hex | bd72e1bbcf4a |
208301111103306 has 48 divisors (see below), whose sum is σ = 451159464224160. Its totient is φ = 64086140289600.
The previous prime is 208301111103299. The next prime is 208301111103307. The reversal of 208301111103306 is 603301111103802.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (208301111103307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 437701 + ... + 20415528.
It is an arithmetic number, because the mean of its divisors is an integer number (9399155504670).
Almost surely, 2208301111103306 is an apocalyptic number.
208301111103306 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
208301111103306 is an abundant number, since it is smaller than the sum of its proper divisors (242858353120854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208301111103306 is a wasteful number, since it uses less digits than its factorization.
208301111103306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20863111 (or 20863098 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 208301111103306 in words is "two hundred eight trillion, three hundred one billion, one hundred eleven million, one hundred three thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •