Base | Representation |
---|---|
bin | 1011101101001010101… |
… | …1000100111010110000 |
3 | 201020002012210001120221 |
4 | 2323102223010322300 |
5 | 11243324332101222 |
6 | 232215131142424 |
7 | 20346343216051 |
oct | 2732253047260 |
9 | 636065701527 |
10 | 201103003312 |
11 | 78318447992 |
12 | 32b84ba4a14 |
13 | 15c6b9b1b63 |
14 | 9a3a7a2728 |
15 | 53702000c7 |
hex | 2ed2ac4eb0 |
201103003312 has 10 divisors (see below), whose sum is σ = 389637068948. Its totient is φ = 100551501648.
The previous prime is 201103003301. The next prime is 201103003337. The reversal of 201103003312 is 213300301102.
201103003312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2011030033122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 12568937707 = 201103003312 / (2 + 0 + 1 + 1 + 0 + 3 + 0 + 0 + 3 + 3 + 1 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6284468838 + ... + 6284468869.
Almost surely, 2201103003312 is an apocalyptic number.
It is an amenable number.
201103003312 is a deficient number, since it is larger than the sum of its proper divisors (188534065636).
201103003312 is a wasteful number, since it uses less digits than its factorization.
201103003312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12568937715 (or 12568937709 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 201103003312 its reverse (213300301102), we get a palindrome (414403304414).
The spelling of 201103003312 in words is "two hundred one billion, one hundred three million, three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •