Base | Representation |
---|---|
bin | 1010001011111110111111… |
… | …0000001100111001000010 |
3 | 1110122210202002121220010011 |
4 | 2202333233300030321002 |
5 | 2432004123021143020 |
6 | 35453400324455134 |
7 | 2234150163125146 |
oct | 242775760147102 |
9 | 43583662556104 |
10 | 11201002131010 |
11 | 3629355769a5a |
12 | 130a9b4b4a4aa |
13 | 633333248353 |
14 | 2aa1ba79b226 |
15 | 14656cad135a |
hex | a2fefc0ce42 |
11201002131010 has 8 divisors (see below), whose sum is σ = 20161803835836. Its totient is φ = 4480400852400.
The previous prime is 11201002130999. The next prime is 11201002131101. The reversal of 11201002131010 is 1013120010211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 11200608386361 + 393744649 = 3346731^2 + 19843^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112010021310102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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, 560050106541 + ... + 560050106560.
Almost surely, 211201002131010 is an apocalyptic number.
11201002131010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11201002131010 is a deficient number, since it is larger than the sum of its proper divisors (8960801704826).
11201002131010 is a wasteful number, since it uses less digits than its factorization.
11201002131010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120100213108.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11201002131010 its reverse (1013120010211), we get a palindrome (12214122141221).
The spelling of 11201002131010 in words is "eleven trillion, two hundred one billion, two million, one hundred thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •