Base | Representation |
---|---|
bin | 110101001000100000… |
… | …1101111100110100101 |
3 | 101220111222121120100110 |
4 | 1222101001233212211 |
5 | 3332140142200031 |
6 | 124230132203233 |
7 | 11146363400631 |
oct | 1522101574645 |
9 | 356458546313 |
10 | 114102303141 |
11 | 44432859192 |
12 | 1a144769519 |
13 | a9b538a508 |
14 | 5745d67dc1 |
15 | 2e7c329c46 |
hex | 1a9106f9a5 |
114102303141 has 4 divisors (see below), whose sum is σ = 152136404192. Its totient is φ = 76068202092.
The previous prime is 114102303137. The next prime is 114102303151. The reversal of 114102303141 is 141303201411.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141303201411 = 3 ⋅47101067137.
It is not a de Polignac number, because 114102303141 - 22 = 114102303137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114102303121) 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, 19017050521 + ... + 19017050526.
It is an arithmetic number, because the mean of its divisors is an integer number (38034101048).
Almost surely, 2114102303141 is an apocalyptic number.
It is an amenable number.
114102303141 is a deficient number, since it is larger than the sum of its proper divisors (38034101051).
114102303141 is an equidigital number, since it uses as much as digits as its factorization.
114102303141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38034101050.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 114102303141 its reverse (141303201411), we get a palindrome (255405504552).
The spelling of 114102303141 in words is "one hundred fourteen billion, one hundred two million, three hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •