Base | Representation |
---|---|
bin | 11000011001111001… |
… | …00110010100111110 |
3 | 1020211002221100200120 |
4 | 30030330212110332 |
5 | 203313120122420 |
6 | 10004035435410 |
7 | 642453063261 |
oct | 141474462476 |
9 | 36732840616 |
10 | 13102114110 |
11 | 5613890288 |
12 | 2657a55b66 |
13 | 130a5a5857 |
14 | 8c414acd8 |
15 | 51a3c2d40 |
hex | 30cf2653e |
13102114110 has 32 divisors (see below), whose sum is σ = 31488860160. Its totient is φ = 3489031968.
The previous prime is 13102114057. The next prime is 13102114111. The reversal of 13102114110 is 1141120131.
It is a super-2 number, since 2×131021141102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13102114110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102114111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282142 + ... + 325281.
It is an arithmetic number, because the mean of its divisors is an integer number (984026880).
Almost surely, 213102114110 is an apocalyptic number.
13102114110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13102114110 is an abundant number, since it is smaller than the sum of its proper divisors (18386746050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102114110 is a wasteful number, since it uses less digits than its factorization.
13102114110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 608152.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 13102114110 its reverse (1141120131), we get a palindrome (14243234241).
The spelling of 13102114110 in words is "thirteen billion, one hundred two million, one hundred fourteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.290 sec. • engine limits •