Base | Representation |
---|---|
bin | 1011111011000110101011… |
… | …1000010101111000111010 |
3 | 1201102022021202122110021211 |
4 | 2332301222320111320322 |
5 | 3204243322013421020 |
6 | 43514355520553334 |
7 | 2522111563520023 |
oct | 276615270257072 |
9 | 51368252573254 |
10 | 13110033342010 |
11 | 41a4a30053190 |
12 | 157898b78284a |
13 | 74136a05a507 |
14 | 334759807c4a |
15 | 17b04e66885a |
hex | bec6ae15e3a |
13110033342010 has 32 divisors (see below), whose sum is σ = 25762088195712. Its totient is φ = 4763812630080.
The previous prime is 13110033341971. The next prime is 13110033342041. The reversal of 13110033342010 is 1024333001131.
It is a super-2 number, since 2×131100333420102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43251054 + ... + 43553113.
It is an arithmetic number, because the mean of its divisors is an integer number (805065256116).
Almost surely, 213110033342010 is an apocalyptic number.
13110033342010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13110033342010 is a deficient number, since it is larger than the sum of its proper divisors (12652054853702).
13110033342010 is a wasteful number, since it uses less digits than its factorization.
13110033342010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86805558.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13110033342010 its reverse (1024333001131), we get a palindrome (14134366343141).
The spelling of 13110033342010 in words is "thirteen trillion, one hundred ten billion, thirty-three million, three hundred forty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •