Base | Representation |
---|---|
bin | 1100110000111100101001… |
… | …1011101100111001010010 |
3 | 1211200201221001222202122120 |
4 | 3030033022123230321102 |
5 | 3314422242412243232 |
6 | 45503340500515110 |
7 | 2645666506101354 |
oct | 314171233547122 |
9 | 54621831882576 |
10 | 14035054415442 |
11 | 4521262362865 |
12 | 16a81073aba96 |
13 | 7aa66651a9c8 |
14 | 36742bca10d4 |
15 | 19513d62b92c |
hex | cc3ca6ece52 |
14035054415442 has 8 divisors (see below), whose sum is σ = 28070108830896. Its totient is φ = 4678351471812.
The previous prime is 14035054415411. The next prime is 14035054415467. The reversal of 14035054415442 is 24451445053041.
It is a sphenic number, since it is the product of 3 distinct primes.
14035054415442 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14035054415394 and 14035054415403.
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, 1169587867948 + ... + 1169587867959.
It is an arithmetic number, because the mean of its divisors is an integer number (3508763603862).
Almost surely, 214035054415442 is an apocalyptic number.
14035054415442 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14035054415442 is a wasteful number, since it uses less digits than its factorization.
14035054415442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2339175735912.
The product of its (nonzero) digits is 768000, while the sum is 42.
Adding to 14035054415442 its reverse (24451445053041), we get a palindrome (38486499468483).
The spelling of 14035054415442 in words is "fourteen trillion, thirty-five billion, fifty-four million, four hundred fifteen thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •