Base | Representation |
---|---|
bin | 110101001111010111… |
… | …1101100111000010101 |
3 | 101221010000200110112221 |
4 | 1222132233230320111 |
5 | 3333123102020141 |
6 | 124305033142341 |
7 | 11155156553623 |
oct | 1523657547025 |
9 | 357100613487 |
10 | 114332454421 |
11 | 44540765259 |
12 | 1a1a985a9b1 |
13 | aa20c705c3 |
14 | 5768758513 |
15 | 2e9263cbd1 |
hex | 1a9ebece15 |
114332454421 has 4 divisors (see below), whose sum is σ = 118020598144. Its totient is φ = 110644310700.
The previous prime is 114332454407. The next prime is 114332454437. The reversal of 114332454421 is 124454233411.
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: 124454233411 = 47 ⋅2647962413.
It is a cyclic number.
It is not a de Polignac number, because 114332454421 - 27 = 114332454293 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 (114332454451) 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, 1844071815 + ... + 1844071876.
It is an arithmetic number, because the mean of its divisors is an integer number (29505149536).
Almost surely, 2114332454421 is an apocalyptic number.
It is an amenable number.
114332454421 is a deficient number, since it is larger than the sum of its proper divisors (3688143723).
114332454421 is an equidigital number, since it uses as much as digits as its factorization.
114332454421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3688143722.
The product of its digits is 46080, while the sum is 34.
Adding to 114332454421 its reverse (124454233411), we get a palindrome (238786687832).
The spelling of 114332454421 in words is "one hundred fourteen billion, three hundred thirty-two million, four hundred fifty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •