Base | Representation |
---|---|
bin | 1100110001100010110100… |
… | …1000011101101110011110 |
3 | 1211201201101010100011111222 |
4 | 3030120231020131232132 |
5 | 3320104233331022200 |
6 | 45512153304413342 |
7 | 2646511430213561 |
oct | 314305510355636 |
9 | 54651333304458 |
10 | 14045300251550 |
11 | 452563a917107 |
12 | 16aa0a6777252 |
13 | 7ab60a120519 |
14 | 367b209384d8 |
15 | 19553cd99d85 |
hex | cc62d21db9e |
14045300251550 has 48 divisors (see below), whose sum is σ = 26158998336000. Its totient is φ = 5610653244000.
The previous prime is 14045300251523. The next prime is 14045300251571. The reversal of 14045300251550 is 5515200354041.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14045300251550.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142834301 + ... + 142932599.
It is an arithmetic number, because the mean of its divisors is an integer number (544979132000).
Almost surely, 214045300251550 is an apocalyptic number.
14045300251550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14045300251550 is a deficient number, since it is larger than the sum of its proper divisors (12113698084450).
14045300251550 is a wasteful number, since it uses less digits than its factorization.
14045300251550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102081 (or 102076 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 14045300251550 in words is "fourteen trillion, forty-five billion, three hundred million, two hundred fifty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •