Base | Representation |
---|---|
bin | 11011000100011000… |
… | …10111111110101001 |
3 | 1101111210002222201212 |
4 | 31202030113332221 |
5 | 214230233004001 |
6 | 10402005522505 |
7 | 1023060423323 |
oct | 154214277651 |
9 | 41453088655 |
10 | 14532313001 |
11 | 6188125938 |
12 | 2996a13435 |
13 | 14a799899b |
14 | 9bc080613 |
15 | 5a0c307bb |
hex | 362317fa9 |
14532313001 has 4 divisors (see below), whose sum is σ = 15297171600. Its totient is φ = 13767454404.
The previous prime is 14532312983. The next prime is 14532313027. The reversal of 14532313001 is 10031323541.
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 14532313001 - 230 = 13458571177 is a prime.
It is a super-2 number, since 2×145323130012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14532313051) 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, 382429271 + ... + 382429308.
It is an arithmetic number, because the mean of its divisors is an integer number (3824292900).
Almost surely, 214532313001 is an apocalyptic number.
It is an amenable number.
14532313001 is a deficient number, since it is larger than the sum of its proper divisors (764858599).
14532313001 is an equidigital number, since it uses as much as digits as its factorization.
14532313001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764858598.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 14532313001 its reverse (10031323541), we get a palindrome (24563636542).
The spelling of 14532313001 in words is "fourteen billion, five hundred thirty-two million, three hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •