Base | Representation |
---|---|
bin | 1100110010000101001111… |
… | …1001000010001001011000 |
3 | 1211202121020002102000012120 |
4 | 3030201103321002021120 |
5 | 3320232144323434230 |
6 | 45520322230141240 |
7 | 2650256420505015 |
oct | 314412371021130 |
9 | 54677202360176 |
10 | 14054540452440 |
11 | 4529551758874 |
12 | 16aba451b1820 |
13 | 7ac450591c07 |
14 | 368359bd870c |
15 | 1958ce1c2310 |
hex | cc853e42258 |
14054540452440 has 64 divisors (see below), whose sum is σ = 42671616825600. Its totient is φ = 3702722301312.
The previous prime is 14054540452417. The next prime is 14054540452471. The reversal of 14054540452440 is 4425404545041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14054540452392 and 14054540452401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 705539260 + ... + 705559179.
It is an arithmetic number, because the mean of its divisors is an integer number (666744012900).
Almost surely, 214054540452440 is an apocalyptic number.
14054540452440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14054540452440 is an abundant number, since it is smaller than the sum of its proper divisors (28617076373160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14054540452440 is a wasteful number, since it uses less digits than its factorization.
14054540452440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1411098536 (or 1411098532 counting only the distinct ones).
The product of its (nonzero) digits is 1024000, while the sum is 42.
Adding to 14054540452440 its reverse (4425404545041), we get a palindrome (18479944997481).
The spelling of 14054540452440 in words is "fourteen trillion, fifty-four billion, five hundred forty million, four hundred fifty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •