Base | Representation |
---|---|
bin | 1100110000001101010010… |
… | …1101110000101110100000 |
3 | 1211122112010010101011110202 |
4 | 3030003110231300232200 |
5 | 3314220224024120000 |
6 | 45453435222044332 |
7 | 2645036464366106 |
oct | 314032455605640 |
9 | 54575103334422 |
10 | 14022342020000 |
11 | 4516929565a26 |
12 | 16a5759b796a8 |
13 | 7a93bb8c6b22 |
14 | 3669837ddc76 |
15 | 194b4758add5 |
hex | cc0d4b70ba0 |
14022342020000 has 60 divisors (see below), whose sum is σ = 34497064769706. Its totient is φ = 5608936800000.
The previous prime is 14022342019891. The next prime is 14022342020021. The reversal of 14022342020000 is 2024322041.
It can be written as a sum of positive squares in 5 ways, for example, as 291552481936 + 13730789538064 = 539956^2 + 3705508^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 350538551 + ... + 350578550.
Almost surely, 214022342020000 is an apocalyptic number.
14022342020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14022342020000 is an abundant number, since it is smaller than the sum of its proper divisors (20474722749706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14022342020000 is an frugal number, since it uses more digits than its factorization.
14022342020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701117131 (or 701117108 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 14022342020000 its reverse (2024322041), we get a palindrome (14024366342041).
The spelling of 14022342020000 in words is "fourteen trillion, twenty-two billion, three hundred forty-two million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •