Base | Representation |
---|---|
bin | 1100110001111111101010… |
… | …1010000011011110011100 |
3 | 1211202110100202100111112200 |
4 | 3030133322222003132130 |
5 | 3320221113044303000 |
6 | 45515513510131500 |
7 | 2650204341412044 |
oct | 314377252033634 |
9 | 54673322314480 |
10 | 14053043353500 |
11 | 452895367a218 |
12 | 16ab6a7950b90 |
13 | 7ac272377258 |
14 | 36825704c724 |
15 | 195842a4c500 |
hex | cc7faa8379c |
14053043353500 has 144 divisors (see below), whose sum is σ = 44577601880448. Its totient is φ = 3726773712000.
The previous prime is 14053043353463. The next prime is 14053043353507. The reversal of 14053043353500 is 535334035041.
14053043353500 is a `hidden beast` number, since 1 + 4 + 0 + 530 + 43 + 35 + 3 + 50 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14053043353507) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7812292 + ... + 9441291.
Almost surely, 214053043353500 is an apocalyptic number.
14053043353500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14053043353500 is an abundant number, since it is smaller than the sum of its proper divisors (30524558526948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14053043353500 is a wasteful number, since it uses less digits than its factorization.
14053043353500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17253789 (or 17253774 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 36.
Adding to 14053043353500 its reverse (535334035041), we get a palindrome (14588377388541).
The spelling of 14053043353500 in words is "fourteen trillion, fifty-three billion, forty-three million, three hundred fifty-three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •