Base | Representation |
---|---|
bin | 11001010010001011000101… |
… | …000110110110011110101010 |
3 | 112120201121122220110011020102 |
4 | 121102023011012312132222 |
5 | 104033400110102413002 |
6 | 1032300325055025402 |
7 | 32264635626110252 |
oct | 3122130506663652 |
9 | 476647586404212 |
10 | 111200010201002 |
11 | 32482728864468 |
12 | 1057b38250b262 |
13 | 4a08167a1b358 |
14 | 1d66175962962 |
15 | ccc87a265a02 |
hex | 6522c51b67aa |
111200010201002 has 8 divisors (see below), whose sum is σ = 166806255795300. Its totient is φ = 55597924935904.
The previous prime is 111200010201001. The next prime is 111200010201041. The reversal of 111200010201002 is 200102010002111.
It can be written as a sum of positive squares in 2 ways, for example, as 105323647578361 + 5876362622641 = 10262731^2 + 2424121^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (111200010201001) 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 in 3 ways as a sum of consecutive naturals, for example, 1040015477 + ... + 1040122392.
Almost surely, 2111200010201002 is an apocalyptic number.
111200010201002 is a deficient number, since it is larger than the sum of its proper divisors (55606245594298).
111200010201002 is a wasteful number, since it uses less digits than its factorization.
111200010201002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2080164600.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 111200010201002 its reverse (200102010002111), we get a palindrome (311302020203113).
The spelling of 111200010201002 in words is "one hundred eleven trillion, two hundred billion, ten million, two hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •