Base | Representation |
---|---|
bin | 110101000110001100… |
… | …0100111010101010101 |
3 | 101220022120001022110221 |
4 | 1222030120213111111 |
5 | 3332010222200001 |
6 | 124214310514341 |
7 | 11144426341336 |
oct | 1521430472525 |
9 | 356276038427 |
10 | 114024412501 |
11 | 443a289885a |
12 | 1a1226659b1 |
13 | a9a21b828c |
14 | 573989028d |
15 | 2e755911a1 |
hex | 1a8c627555 |
114024412501 has 4 divisors (see below), whose sum is σ = 115726269472. Its totient is φ = 112322555532.
The previous prime is 114024412483. The next prime is 114024412517. The reversal of 114024412501 is 105214420411.
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: 105214420411 = 89 ⋅1182184499.
It is a cyclic number.
It is not a de Polignac number, because 114024412501 - 211 = 114024410453 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 (114024412591) 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, 850928385 + ... + 850928518.
It is an arithmetic number, because the mean of its divisors is an integer number (28931567368).
Almost surely, 2114024412501 is an apocalyptic number.
It is an amenable number.
114024412501 is a deficient number, since it is larger than the sum of its proper divisors (1701856971).
114024412501 is an equidigital number, since it uses as much as digits as its factorization.
114024412501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1701856970.
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 114024412501 its reverse (105214420411), we get a palindrome (219238832912).
The spelling of 114024412501 in words is "one hundred fourteen billion, twenty-four million, four hundred twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •