Base | Representation |
---|---|
bin | 110101001111001010… |
… | …1001111001000000001 |
3 | 101221002112121222221001 |
4 | 1222132111033020001 |
5 | 3333114313014201 |
6 | 124304224332001 |
7 | 11155043600416 |
oct | 1523625171001 |
9 | 357075558831 |
10 | 114325516801 |
11 | 44537856991 |
12 | 1a1a7474001 |
13 | aa1c6b18c2 |
14 | 576787010d |
15 | 2e91c1c301 |
hex | 1a9e54f201 |
114325516801 has 4 divisors (see below), whose sum is σ = 114457992192. Its totient is φ = 114193041412.
The previous prime is 114325516631. The next prime is 114325516831. The reversal of 114325516801 is 108615523411.
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 114325516801 - 211 = 114325514753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114325516831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66236401 + ... + 66238126.
It is an arithmetic number, because the mean of its divisors is an integer number (28614498048).
Almost surely, 2114325516801 is an apocalyptic number.
It is an amenable number.
114325516801 is a deficient number, since it is larger than the sum of its proper divisors (132475391).
114325516801 is an equidigital number, since it uses as much as digits as its factorization.
114325516801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132475390.
The product of its (nonzero) digits is 28800, while the sum is 37.
It can be divided in two parts, 114325 and 516801, that added together give a triangular number (631126 = T1123).
The spelling of 114325516801 in words is "one hundred fourteen billion, three hundred twenty-five million, five hundred sixteen thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •