Base | Representation |
---|---|
bin | 1100111011001110001000… |
… | …0111111110010100100100 |
3 | 1212022121111001012122222202 |
4 | 3032303202013332110210 |
5 | 3330320221130300020 |
6 | 50120405514314032 |
7 | 2664515230043333 |
oct | 316634207762444 |
9 | 55277431178882 |
10 | 14211545556260 |
11 | 458a09aa77118 |
12 | 1716361a28918 |
13 | 7c11b2213400 |
14 | 371bb1a73d1a |
15 | 199a1cc77e75 |
hex | cece21fe524 |
14211545556260 has 72 divisors (see below), whose sum is σ = 32846330028456. Its totient is φ = 5161317857280.
The previous prime is 14211545556253. The next prime is 14211545556331. The reversal of 14211545556260 is 6265554511241.
It can be written as a sum of positive squares in 12 ways, for example, as 13681876005604 + 529669550656 = 3698902^2 + 727784^2 .
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, 34257749 + ... + 34670108.
It is an arithmetic number, because the mean of its divisors is an integer number (456199028173).
Almost surely, 214211545556260 is an apocalyptic number.
14211545556260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14211545556260 is an abundant number, since it is smaller than the sum of its proper divisors (18634784472196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14211545556260 is a wasteful number, since it uses less digits than its factorization.
14211545556260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68927953 (or 68927938 counting only the distinct ones).
The product of its (nonzero) digits is 1440000, while the sum is 47.
The spelling of 14211545556260 in words is "fourteen trillion, two hundred eleven billion, five hundred forty-five million, five hundred fifty-six thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •