Base | Representation |
---|---|
bin | 1100110110011111010000… |
… | …0011111010000000111110 |
3 | 1212000211121212102012221112 |
4 | 3031213310003322000332 |
5 | 3323002213434220220 |
6 | 50015202115202022 |
7 | 2655606400061456 |
oct | 315476403720076 |
9 | 55024555365845 |
10 | 14130242101310 |
11 | 4558669323045 |
12 | 17026515a6312 |
13 | 7b6626033b9a |
14 | 36bc9bb58d66 |
15 | 1978601355c5 |
hex | cd9f40fa03e |
14130242101310 has 8 divisors (see below), whose sum is σ = 25434435782376. Its totient is φ = 5652096840520.
The previous prime is 14130242101279. The next prime is 14130242101369. The reversal of 14130242101310 is 1310124203141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×141302421013102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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, 706512105056 + ... + 706512105075.
It is an arithmetic number, because the mean of its divisors is an integer number (3179304472797).
Almost surely, 214130242101310 is an apocalyptic number.
14130242101310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14130242101310 is a deficient number, since it is larger than the sum of its proper divisors (11304193681066).
14130242101310 is a wasteful number, since it uses less digits than its factorization.
14130242101310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413024210138.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14130242101310 its reverse (1310124203141), we get a palindrome (15440366304451).
The spelling of 14130242101310 in words is "fourteen trillion, one hundred thirty billion, two hundred forty-two million, one hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •