Base | Representation |
---|---|
bin | 1010000000110111111011… |
… | …1000110110110100000110 |
3 | 1102222120001220001200100121 |
4 | 2200031332320312310012 |
5 | 2420342221240412241 |
6 | 35225552304532154 |
7 | 2214312166653244 |
oct | 240157670666406 |
9 | 42876056050317 |
10 | 11010130013446 |
11 | 35654083a4a53 |
12 | 1299a0632105a |
13 | 61b335033155 |
14 | 2a0c70a9d794 |
15 | 1415eab99ad1 |
hex | a037ee36d06 |
11010130013446 has 4 divisors (see below), whose sum is σ = 16515195020172. Its totient is φ = 5505065006722.
The previous prime is 11010130013423. The next prime is 11010130013479. The reversal of 11010130013446 is 64431003101011.
It is a happy number.
11010130013446 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×110101300134462 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11010130013446.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2752532503360 + ... + 2752532503363.
It is an arithmetic number, because the mean of its divisors is an integer number (4128798755043).
Almost surely, 211010130013446 is an apocalyptic number.
11010130013446 is a deficient number, since it is larger than the sum of its proper divisors (5505065006726).
11010130013446 is an equidigital number, since it uses as much as digits as its factorization.
11010130013446 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5505065006725.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 11010130013446 its reverse (64431003101011), we get a palindrome (75441133114457).
The spelling of 11010130013446 in words is "eleven trillion, ten billion, one hundred thirty million, thirteen thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •