Base | Representation |
---|---|
bin | 100011110010111… |
… | …1000101110110001 |
3 | 10002201002220200221 |
4 | 1013211320232301 |
5 | 4424441122113 |
6 | 315104013041 |
7 | 41523205120 |
oct | 10745705661 |
9 | 3081086627 |
10 | 1201114033 |
11 | 566aa7829 |
12 | 296301181 |
13 | 161ac4582 |
14 | b573dab7 |
15 | 706aa98d |
hex | 47978bb1 |
1201114033 has 8 divisors (see below), whose sum is σ = 1377118080. Its totient is φ = 1026214080.
The previous prime is 1201113989. The next prime is 1201114067. The reversal of 1201114033 is 3304111021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1201114033 - 221 = 1199016881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201113998 and 1201114016.
It is not an unprimeable number, because it can be changed into a prime (1201114433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 273688 + ... + 278041.
It is an arithmetic number, because the mean of its divisors is an integer number (172139760).
Almost surely, 21201114033 is an apocalyptic number.
It is an amenable number.
1201114033 is a deficient number, since it is larger than the sum of its proper divisors (176004047).
1201114033 is an equidigital number, since it uses as much as digits as its factorization.
1201114033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552047.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1201114033 is about 34657.0921024832. The cubic root of 1201114033 is about 1062.9873110049.
Adding to 1201114033 its reverse (3304111021), we get a palindrome (4505225054).
The spelling of 1201114033 in words is "one billion, two hundred one million, one hundred fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •