Base | Representation |
---|---|
bin | 100011110010111… |
… | …1000011111011101 |
3 | 10002201002212100122 |
4 | 1013211320133131 |
5 | 4424441104203 |
6 | 315104004325 |
7 | 41523202220 |
oct | 10745703735 |
9 | 3081085318 |
10 | 1201113053 |
11 | 566aa7018 |
12 | 2963006a5 |
13 | 161ac3caa |
14 | b573d5b7 |
15 | 706aa538 |
hex | 479787dd |
1201113053 has 16 divisors (see below), whose sum is σ = 1455076224. Its totient is φ = 967879680.
The previous prime is 1201113037. The next prime is 1201113131. The reversal of 1201113053 is 3503111021.
It is a cyclic number.
It is not a de Polignac number, because 1201113053 - 24 = 1201113037 is a prime.
It is a super-3 number, since 3×12011130533 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201113553) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 111098 + ... + 121428.
It is an arithmetic number, because the mean of its divisors is an integer number (90942264).
Almost surely, 21201113053 is an apocalyptic number.
It is an amenable number.
1201113053 is a deficient number, since it is larger than the sum of its proper divisors (253963171).
1201113053 is a wasteful number, since it uses less digits than its factorization.
1201113053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11332.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 1201113053 is about 34657.0779639600. The cubic root of 1201113053 is about 1062.9870219044.
Adding to 1201113053 its reverse (3503111021), we get a palindrome (4704224074).
The spelling of 1201113053 in words is "one billion, two hundred one million, one hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •