Base | Representation |
---|---|
bin | 1100101111100111001011… |
… | …1101011111010101101010 |
3 | 1211121112201011212101220120 |
4 | 3023321302331133111222 |
5 | 3314033301140310242 |
6 | 45445024142104110 |
7 | 2644225125120303 |
oct | 313716275372552 |
9 | 54545634771816 |
10 | 14012112041322 |
11 | 4512559a5259a |
12 | 16a3783b7b036 |
13 | 7a844b386cc5 |
14 | 366292cd37aa |
15 | 1947494011ec |
hex | cbe72f5f56a |
14012112041322 has 8 divisors (see below), whose sum is σ = 28024224082656. Its totient is φ = 4670704013772.
The previous prime is 14012112041309. The next prime is 14012112041329. The reversal of 14012112041322 is 22314021121041.
It is a sphenic number, since it is the product of 3 distinct primes.
14012112041322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14012112041292 and 14012112041301.
It is not an unprimeable number, because it can be changed into a prime (14012112041329) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1167676003438 + ... + 1167676003449.
It is an arithmetic number, because the mean of its divisors is an integer number (3503028010332).
Almost surely, 214012112041322 is an apocalyptic number.
14012112041322 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.
14012112041322 is a wasteful number, since it uses less digits than its factorization.
14012112041322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2335352006892.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 14012112041322 its reverse (22314021121041), we get a palindrome (36326133162363).
The spelling of 14012112041322 in words is "fourteen trillion, twelve billion, one hundred twelve million, forty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •