Base | Representation |
---|---|
bin | 11001010010010101100000… |
… | …110010010111001000011010 |
3 | 112120202200120120122000101112 |
4 | 121102111200302113020122 |
5 | 104034041030233310020 |
6 | 1032305420412420322 |
7 | 32265513335653460 |
oct | 3122254062271032 |
9 | 476680516560345 |
10 | 111211212010010 |
11 | 32487456a00362 |
12 | 10581589a776a2 |
13 | 4a092316b44c8 |
14 | 1d66919566830 |
15 | ccccd38ba2c5 |
hex | 652560c9721a |
111211212010010 has 128 divisors (see below), whose sum is σ = 237064131053568. Its totient is φ = 36771114240000.
The previous prime is 111211212010009. The next prime is 111211212010027. The reversal of 111211212010010 is 10010212112111.
111211212010010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 177377375 + ... + 178003245.
It is an arithmetic number, because the mean of its divisors is an integer number (1852063523856).
Almost surely, 2111211212010010 is an apocalyptic number.
111211212010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111211212010010 is an abundant number, since it is smaller than the sum of its proper divisors (125852919043558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111211212010010 is a wasteful number, since it uses less digits than its factorization.
111211212010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 626640.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111211212010010 its reverse (10010212112111), we get a palindrome (121221424122121).
The spelling of 111211212010010 in words is "one hundred eleven trillion, two hundred eleven billion, two hundred twelve million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •