Base | Representation |
---|---|
bin | 1100110100110110111001… |
… | …1011011101000010001101 |
3 | 1211221011022200022110110102 |
4 | 3031031232123131002031 |
5 | 3322022331430321331 |
6 | 45554250345420445 |
7 | 2653565261641346 |
oct | 315155633350215 |
9 | 54834280273412 |
10 | 14102230323341 |
11 | 45477a4411716 |
12 | 16b913449a725 |
13 | 7b3ab0851234 |
14 | 36a7a17c10cd |
15 | 196c70d444cb |
hex | cd36e6dd08d |
14102230323341 has 4 divisors (see below), whose sum is σ = 14102568653472. Its totient is φ = 14101891993212.
The previous prime is 14102230323287. The next prime is 14102230323353. The reversal of 14102230323341 is 14332303220141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14102230323341 - 26 = 14102230323277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14102230323241) 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, 169102535 + ... + 169185908.
It is an arithmetic number, because the mean of its divisors is an integer number (3525642163368).
Almost surely, 214102230323341 is an apocalyptic number.
It is an amenable number.
14102230323341 is a deficient number, since it is larger than the sum of its proper divisors (338330131).
14102230323341 is an equidigital number, since it uses as much as digits as its factorization.
14102230323341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338330130.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 14102230323341 its reverse (14332303220141), we get a palindrome (28434533543482).
The spelling of 14102230323341 in words is "fourteen trillion, one hundred two billion, two hundred thirty million, three hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •