Base | Representation |
---|---|
bin | 1100110001110110100101… |
… | …0011101101001111011100 |
3 | 1211202020001210210002120010 |
4 | 3030131221103231033130 |
5 | 3320201114312031230 |
6 | 45514431515323220 |
7 | 2650060041140403 |
oct | 314355123551734 |
9 | 54666053702503 |
10 | 14050604798940 |
11 | 4527912124076 |
12 | 16ab127150510 |
13 | 7abc740ac968 |
14 | 3680a523463a |
15 | 19574d90c9b0 |
hex | cc7694ed3dc |
14050604798940 has 48 divisors (see below), whose sum is σ = 39569102098848. Its totient is φ = 3725169978624.
The previous prime is 14050604798933. The next prime is 14050604798941. The reversal of 14050604798940 is 4989740605041.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14050604798941) 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, 676801027 + ... + 676821786.
It is an arithmetic number, because the mean of its divisors is an integer number (824356293726).
Almost surely, 214050604798940 is an apocalyptic number.
14050604798940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14050604798940 is an abundant number, since it is smaller than the sum of its proper divisors (25518497299908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14050604798940 is a wasteful number, since it uses less digits than its factorization.
14050604798940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353622998 (or 1353622996 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 14050604798940 in words is "fourteen trillion, fifty billion, six hundred four million, seven hundred ninety-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •