Base | Representation |
---|---|
bin | 1101001100000001011101… |
… | …1001110011000011110001 |
3 | 1220100012120000200000102002 |
4 | 3103000113121303003301 |
5 | 3400032403232330001 |
6 | 50501145000503345 |
7 | 3024414346222655 |
oct | 323002731630361 |
9 | 56305500600362 |
10 | 14500202230001 |
11 | 4690557159514 |
12 | 17622a047ab55 |
13 | 812494c5a037 |
14 | 381b56494a65 |
15 | 1a22b467b46b |
hex | d30176730f1 |
14500202230001 has 4 divisors (see below), whose sum is σ = 15353155302372. Its totient is φ = 13647249157632.
The previous prime is 14500202229949. The next prime is 14500202230061. The reversal of 14500202230001 is 10003220200541.
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 13229216565601 + 1270985664400 = 3637199^2 + 1127380^2 .
It is a cyclic number.
It is not a de Polignac number, because 14500202230001 - 214 = 14500202213617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14500202230061) 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, 426476536160 + ... + 426476536193.
It is an arithmetic number, because the mean of its divisors is an integer number (3838288825593).
Almost surely, 214500202230001 is an apocalyptic number.
It is an amenable number.
14500202230001 is a deficient number, since it is larger than the sum of its proper divisors (852953072371).
14500202230001 is an equidigital number, since it uses as much as digits as its factorization.
14500202230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852953072370.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 14500202230001 its reverse (10003220200541), we get a palindrome (24503422430542).
The spelling of 14500202230001 in words is "fourteen trillion, five hundred billion, two hundred two million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •