Base | Representation |
---|---|
bin | 110101001110110100… |
… | …1011000011000001111 |
3 | 101221001201222220210012 |
4 | 1222131221120120033 |
5 | 3333103342122432 |
6 | 124303134103435 |
7 | 11154544066211 |
oct | 1523551303017 |
9 | 357051886705 |
10 | 114314020367 |
11 | 445313144a8 |
12 | 1a1a364ab7b |
13 | aa1a1b7b91 |
14 | 576611a5b1 |
15 | 2e90beacb2 |
hex | 1a9da5860f |
114314020367 has 4 divisors (see below), whose sum is σ = 114319216680. Its totient is φ = 114308824056.
The previous prime is 114314020361. The next prime is 114314020369. The reversal of 114314020367 is 763020413411.
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 114314020367 - 24 = 114314020351 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 (114314020361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2565017 + ... + 2609202.
It is an arithmetic number, because the mean of its divisors is an integer number (28579804170).
Almost surely, 2114314020367 is an apocalyptic number.
114314020367 is a deficient number, since it is larger than the sum of its proper divisors (5196313).
114314020367 is an equidigital number, since it uses as much as digits as its factorization.
114314020367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5196312.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 114314020367 its reverse (763020413411), we get a palindrome (877334433778).
The spelling of 114314020367 in words is "one hundred fourteen billion, three hundred fourteen million, twenty thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •