Base | Representation |
---|---|
bin | 1100110101011111001000… |
… | …1101100010001100001110 |
3 | 1211222012012102001220221200 |
4 | 3031113302031202030032 |
5 | 3322211441441422200 |
6 | 50003234222010330 |
7 | 2654430032615241 |
oct | 315276215421416 |
9 | 54865172056850 |
10 | 14113031201550 |
11 | 4551337207346 |
12 | 16bb2497169a6 |
13 | 7b4b1243b228 |
14 | 36b10805b258 |
15 | 1971a419e800 |
hex | cd5f236230e |
14113031201550 has 72 divisors (see below), whose sum is σ = 37917850315800. Its totient is φ = 3763391630400.
The previous prime is 14113031201539. The next prime is 14113031201551. The reversal of 14113031201550 is 5510213031141.
14113031201550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14113031201551) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 21520401 + ... + 22166499.
Almost surely, 214113031201550 is an apocalyptic number.
14113031201550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14113031201550 is an abundant number, since it is smaller than the sum of its proper divisors (23804819114250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14113031201550 is a wasteful number, since it uses less digits than its factorization.
14113031201550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 694658 (or 694650 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 14113031201550 its reverse (5510213031141), we get a palindrome (19623244232691).
The spelling of 14113031201550 in words is "fourteen trillion, one hundred thirteen billion, thirty-one million, two hundred one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •