Base | Representation |
---|---|
bin | 11010000110010001… |
… | …11111001110101101 |
3 | 1100011110210101110202 |
4 | 31003020333032231 |
5 | 212143400102001 |
6 | 10234155243245 |
7 | 1004133231656 |
oct | 150310771655 |
9 | 40143711422 |
10 | 14011331501 |
11 | 5a40038812 |
12 | 2870449525 |
13 | 1423a787cb |
14 | 96cbc652d |
15 | 57012096b |
hex | 34323f3ad |
14011331501 has 4 divisors (see below), whose sum is σ = 14011668732. Its totient is φ = 14010994272.
The previous prime is 14011331459. The next prime is 14011331531. The reversal of 14011331501 is 10513311041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8019023401 + 5992308100 = 89549^2 + 77410^2 .
It is a cyclic number.
It is not a de Polignac number, because 14011331501 - 226 = 13944222637 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 (14011331531) 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, 95816 + ... + 192881.
It is an arithmetic number, because the mean of its divisors is an integer number (3502917183).
Almost surely, 214011331501 is an apocalyptic number.
It is an amenable number.
14011331501 is a deficient number, since it is larger than the sum of its proper divisors (337231).
14011331501 is an equidigital number, since it uses as much as digits as its factorization.
14011331501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337230.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 14011331501 its reverse (10513311041), we get a palindrome (24524642542).
The spelling of 14011331501 in words is "fourteen billion, eleven million, three hundred thirty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •