Base | Representation |
---|---|
bin | 1100110101011111001100… |
… | …0011000000111101110010 |
3 | 1211222012020101110012100020 |
4 | 3031113303003000331302 |
5 | 3322212004034034414 |
6 | 50003235442304310 |
7 | 2654430263026041 |
oct | 315276303007562 |
9 | 54865211405306 |
10 | 14113045221234 |
11 | 4551344112563 |
12 | 16bb252358096 |
13 | 7b4b153095bb |
14 | 36b109c6a558 |
15 | 1971a551d7a9 |
hex | cd5f30c0f72 |
14113045221234 has 8 divisors (see below), whose sum is σ = 28226090442480. Its totient is φ = 4704348407076.
The previous prime is 14113045221139. The next prime is 14113045221259. The reversal of 14113045221234 is 43212254031141.
It is a sphenic number, since it is the product of 3 distinct primes.
14113045221234 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14113045221195 and 14113045221204.
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, 1176087101764 + ... + 1176087101775.
It is an arithmetic number, because the mean of its divisors is an integer number (3528261305310).
Almost surely, 214113045221234 is an apocalyptic number.
14113045221234 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.
14113045221234 is a wasteful number, since it uses less digits than its factorization.
14113045221234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2352174203544.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 14113045221234 its reverse (43212254031141), we get a palindrome (57325299252375).
The spelling of 14113045221234 in words is "fourteen trillion, one hundred thirteen billion, forty-five million, two hundred twenty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •