Base | Representation |
---|---|
bin | 1100110111000100000001… |
… | …1010111011110100010100 |
3 | 1212001210002210111222210120 |
4 | 3031301000122323310110 |
5 | 3323132422431003022 |
6 | 50023513413551540 |
7 | 2656406120403045 |
oct | 315610032736424 |
9 | 55053083458716 |
10 | 14140113141012 |
11 | 45618742662a1 |
12 | 17045473455b0 |
13 | 7b753a0aab91 |
14 | 36c556b0c8cc |
15 | 197c3ba1cd5c |
hex | cdc406bbd14 |
14140113141012 has 96 divisors (see below), whose sum is σ = 34980020595072. Its totient is φ = 4430323163136.
The previous prime is 14140113140981. The next prime is 14140113141017. The reversal of 14140113141012 is 21014131104141.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14140113141017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 917407018 + ... + 917422430.
It is an arithmetic number, because the mean of its divisors is an integer number (364375214532).
Almost surely, 214140113141012 is an apocalyptic number.
14140113141012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14140113141012 is an abundant number, since it is smaller than the sum of its proper divisors (20839907454060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14140113141012 is a wasteful number, since it uses less digits than its factorization.
14140113141012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21017 (or 21015 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 14140113141012 its reverse (21014131104141), we get a palindrome (35154244245153).
The spelling of 14140113141012 in words is "fourteen trillion, one hundred forty billion, one hundred thirteen million, one hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •