Base | Representation |
---|---|
bin | 1010000001000011010111… |
… | …1100100011011001010010 |
3 | 1102222211222221001210010121 |
4 | 2200100311330203121102 |
5 | 2420420014002304020 |
6 | 35231221135220454 |
7 | 2214451251506653 |
oct | 240206574433122 |
9 | 42884887053117 |
10 | 11013201213010 |
11 | 3566743a75707 |
12 | 129a52297772a |
13 | 61b7043b61b9 |
14 | 2a108291b52a |
15 | 14172a604baa |
hex | a0435f23652 |
11013201213010 has 8 divisors (see below), whose sum is σ = 19823762183436. Its totient is φ = 4405280485200.
The previous prime is 11013201212927. The next prime is 11013201213097. The reversal of 11013201213010 is 1031210231011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10962992503681 + 50208709329 = 3311041^2 + 224073^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
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 in 3 ways as a sum of consecutive naturals, for example, 550660060641 + ... + 550660060660.
Almost surely, 211013201213010 is an apocalyptic number.
11013201213010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11013201213010 is a deficient number, since it is larger than the sum of its proper divisors (8810560970426).
11013201213010 is a wasteful number, since it uses less digits than its factorization.
11013201213010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101320121308.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11013201213010 its reverse (1031210231011), we get a palindrome (12044411444021).
The spelling of 11013201213010 in words is "eleven trillion, thirteen billion, two hundred one million, two hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •