Base | Representation |
---|---|
bin | 1101000011100001101011… |
… | …0110001000011111100011 |
3 | 1212211020210001020101010011 |
4 | 3100320122312020133203 |
5 | 3340134431130221121 |
6 | 50310124232545351 |
7 | 3011026141133335 |
oct | 320703266103743 |
9 | 55736701211104 |
10 | 14354231101411 |
11 | 4634660274063 |
12 | 1739b42b52257 |
13 | 8017a129a676 |
14 | 378a69c11455 |
15 | 19d5be6267e1 |
hex | d0e1ad887e3 |
14354231101411 has 4 divisors (see below), whose sum is σ = 14354420414752. Its totient is φ = 14354041788072.
The previous prime is 14354231101391. The next prime is 14354231101423. The reversal of 14354231101411 is 11410113245341.
14354231101411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14354231101411 - 27 = 14354231101283 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14354231101711) 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, 94542891 + ... + 94694596.
It is an arithmetic number, because the mean of its divisors is an integer number (3588605103688).
Almost surely, 214354231101411 is an apocalyptic number.
14354231101411 is a deficient number, since it is larger than the sum of its proper divisors (189313341).
14354231101411 is an equidigital number, since it uses as much as digits as its factorization.
14354231101411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189313340.
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 14354231101411 its reverse (11410113245341), we get a palindrome (25764344346752).
The spelling of 14354231101411 in words is "fourteen trillion, three hundred fifty-four billion, two hundred thirty-one million, one hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •