Base | Representation |
---|---|
bin | 1100111111100010111101… |
… | …1100110000010100001100 |
3 | 1212120201021221212001112011 |
4 | 3033320233130300110030 |
5 | 3333024413431343310 |
6 | 50214455432551004 |
7 | 3003055601302615 |
oct | 317705734602414 |
9 | 55521257761464 |
10 | 14285857293580 |
11 | 4608664013264 |
12 | 1728840852464 |
13 | 7c81c5a29802 |
14 | 37562118ac0c |
15 | 19b91bb8a78a |
hex | cfe2f73050c |
14285857293580 has 12 divisors (see below), whose sum is σ = 30000300316560. Its totient is φ = 5714342917424.
The previous prime is 14285857293569. The next prime is 14285857293593. The reversal of 14285857293580 is 8539275858241.
It is a super-2 number, since 2×142858572935802 (a number of 27 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 357146432320 + ... + 357146432359.
It is an arithmetic number, because the mean of its divisors is an integer number (2500025026380).
Almost surely, 214285857293580 is an apocalyptic number.
14285857293580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14285857293580 is an abundant number, since it is smaller than the sum of its proper divisors (15714443022980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14285857293580 is a wasteful number, since it uses less digits than its factorization.
14285857293580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714292864688 (or 714292864686 counting only the distinct ones).
The product of its (nonzero) digits is 193536000, while the sum is 67.
The spelling of 14285857293580 in words is "fourteen trillion, two hundred eighty-five billion, eight hundred fifty-seven million, two hundred ninety-three thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •