Base | Representation |
---|---|
bin | 1011110110101000100100… |
… | …0011101011111100110110 |
3 | 1201010222001020000122222111 |
4 | 2331222021003223330312 |
5 | 3202014023414033420 |
6 | 43415214443321234 |
7 | 2513422410666451 |
oct | 275521103537466 |
9 | 51128036018874 |
10 | 13033230221110 |
11 | 41753a8758750 |
12 | 1565b1652021a |
13 | 73704a340848 |
14 | 330b51484498 |
15 | 179056b7d45a |
hex | bda890ebf36 |
13033230221110 has 64 divisors (see below), whose sum is σ = 25871037825024. Its totient is φ = 4688050723200.
The previous prime is 13033230221107. The next prime is 13033230221113. The reversal of 13033230221110 is 1112203233031.
It is an interprime number because it is at equal distance from previous prime (13033230221107) and next prime (13033230221113).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033230221113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2159115 + ... + 5543305.
It is an arithmetic number, because the mean of its divisors is an integer number (404234966016).
Almost surely, 213033230221110 is an apocalyptic number.
13033230221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13033230221110 is a deficient number, since it is larger than the sum of its proper divisors (12837807603914).
13033230221110 is a wasteful number, since it uses less digits than its factorization.
13033230221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3384589.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13033230221110 its reverse (1112203233031), we get a palindrome (14145433454141).
The spelling of 13033230221110 in words is "thirteen trillion, thirty-three billion, two hundred thirty million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •