Base | Representation |
---|---|
bin | 1100110000110101110010… |
… | …1000010101010110010110 |
3 | 1211200120011200121012120022 |
4 | 3030031130220111112112 |
5 | 3314410004312424420 |
6 | 45502434012305142 |
7 | 2645603036566400 |
oct | 314153450252626 |
9 | 54616150535508 |
10 | 14033212233110 |
11 | 45204a7507a24 |
12 | 16a78924721b2 |
13 | 7aa43197b9a5 |
14 | 3672d5367b70 |
15 | 195081a3ec25 |
hex | cc35ca15596 |
14033212233110 has 24 divisors (see below), whose sum is σ = 29383828064640. Its totient is φ = 4811387051184.
The previous prime is 14033212233091. The next prime is 14033212233179. The reversal of 14033212233110 is 1133221233041.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 14033212233110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14319603830 + ... + 14319604809.
It is an arithmetic number, because the mean of its divisors is an integer number (1224326169360).
Almost surely, 214033212233110 is an apocalyptic number.
14033212233110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14033212233110 is an abundant number, since it is smaller than the sum of its proper divisors (15350615831530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14033212233110 is a wasteful number, since it uses less digits than its factorization.
14033212233110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28639208660 (or 28639208653 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 14033212233110 its reverse (1133221233041), we get a palindrome (15166433466151).
The spelling of 14033212233110 in words is "fourteen trillion, thirty-three billion, two hundred twelve million, two hundred thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •