Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …0100111100111001010010 |
3 | 1102222122212020100121000212 |
4 | 2200032333110330321102 |
5 | 2420401430021321320 |
6 | 35230251444444122 |
7 | 2214351035140100 |
oct | 240167724747122 |
9 | 42878766317025 |
10 | 11011211120210 |
11 | 3565912685514 |
12 | 129a0683a9642 |
13 | 61b477cca3b2 |
14 | 2a0d344c0c70 |
15 | 141660a4c9c5 |
hex | a03bf53ce52 |
11011211120210 has 48 divisors (see below), whose sum is σ = 23400249153984. Its totient is φ = 3718925023968.
The previous prime is 11011211120183. The next prime is 11011211120243. The reversal of 11011211120210 is 1202111211011.
It is a Harshad number since it is a multiple of its sum of digits (14).
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 23 ways as a sum of consecutive naturals, for example, 167667614 + ... + 167733273.
It is an arithmetic number, because the mean of its divisors is an integer number (487505190708).
Almost surely, 211011211120210 is an apocalyptic number.
11011211120210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011211120210 is an abundant number, since it is smaller than the sum of its proper divisors (12389038033774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011211120210 is a wasteful number, since it uses less digits than its factorization.
11011211120210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335400975 (or 335400968 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11011211120210 its reverse (1202111211011), we get a palindrome (12213322331221).
The spelling of 11011211120210 in words is "eleven trillion, eleven billion, two hundred eleven million, one hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •