Base | Representation |
---|---|
bin | 1100110000000100100101… |
… | …0110111011111000000010 |
3 | 1211122022002011222121112202 |
4 | 3030001021112323320002 |
5 | 3314200432011101310 |
6 | 45452411222153202 |
7 | 2644624524520013 |
oct | 314011126737002 |
9 | 54568064877482 |
10 | 14020004003330 |
11 | 4515939839446 |
12 | 16a5206b82802 |
13 | 7a9108400b00 |
14 | 3668010b700a |
15 | 194a5c1aa3a5 |
hex | cc0495bbe02 |
14020004003330 has 48 divisors (see below), whose sum is σ = 27327240086400. Its totient is φ = 5176488792384.
The previous prime is 14020004003321. The next prime is 14020004003339. The reversal of 14020004003330 is 3330040002041.
It is an interprime number because it is at equal distance from previous prime (14020004003321) and next prime (14020004003339).
It is not an unprimeable number, because it can be changed into a prime (14020004003339) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 93454721 + ... + 93604619.
It is an arithmetic number, because the mean of its divisors is an integer number (569317501800).
Almost surely, 214020004003330 is an apocalyptic number.
14020004003330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14020004003330 is a deficient number, since it is larger than the sum of its proper divisors (13307236083070).
14020004003330 is a wasteful number, since it uses less digits than its factorization.
14020004003330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205275 (or 205262 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 14020004003330 its reverse (3330040002041), we get a palindrome (17350044005371).
The spelling of 14020004003330 in words is "fourteen trillion, twenty billion, four million, three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •