Base | Representation |
---|---|
bin | 11011011000111000… |
… | …01011111011101001 |
3 | 1101221202121021200121 |
4 | 31230130023323221 |
5 | 220103240330441 |
6 | 10431030403241 |
7 | 1030245615400 |
oct | 155434137351 |
9 | 41852537617 |
10 | 14704230121 |
11 | 62661777a9 |
12 | 2a24500521 |
13 | 150449c7a9 |
14 | 9d6c32637 |
15 | 5b0d8ddd1 |
hex | 36c70bee9 |
14704230121 has 27 divisors (see below), whose sum is σ = 18188128119. Its totient is φ = 11850595008.
The previous prime is 14704230089. The next prime is 14704230157. The reversal of 14704230121 is 12103240741.
The square root of 14704230121 is 121261.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 11447930025 + 3256300096 = 106995^2 + 57064^2 .
It is not a de Polignac number, because 14704230121 - 25 = 14704230089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14704230161) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 14429550 + ... + 14430568.
Almost surely, 214704230121 is an apocalyptic number.
14704230121 is the 121261-st square number.
14704230121 is the 60631-st centered octagonal number.
It is an amenable number.
14704230121 is a deficient number, since it is larger than the sum of its proper divisors (3483897998).
14704230121 is an frugal number, since it uses more digits than its factorization.
14704230121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2086 (or 1043 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
Multiplying 14704230121 by its sum of digits (25), we get a square (367605753025 = 6063052).
Adding to 14704230121 its reverse (12103240741), we get a palindrome (26807470862).
The spelling of 14704230121 in words is "fourteen billion, seven hundred four million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •