Base | Representation |
---|---|
bin | 1101001010011011000011… |
… | …1101011001111011000100 |
3 | 1220020120121022011101002011 |
4 | 3102212300331121323010 |
5 | 3344110104202112304 |
6 | 50440401202224004 |
7 | 3022422223514044 |
oct | 322466075317304 |
9 | 56216538141064 |
10 | 14472713707204 |
11 | 467a930648485 |
12 | 1758aaa655004 |
13 | 80ca03cb242c |
14 | 3806a9807724 |
15 | 1a1706298c04 |
hex | d29b0f59ec4 |
14472713707204 has 27 divisors (see below), whose sum is σ = 25382747477997. Its totient is φ = 7220534761584.
The previous prime is 14472713707147. The next prime is 14472713707321. The reversal of 14472713707204 is 40270731727441.
It is a happy number.
The square root of 14472713707204 is 3804302.
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., 387344416900 + 14085369290304 = 622370^2 + 3753048^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3979298074 + ... + 3979301710.
Almost surely, 214472713707204 is an apocalyptic number.
14472713707204 is the 3804302-nd square number.
It is an amenable number.
14472713707204 is a deficient number, since it is larger than the sum of its proper divisors (10910033770793).
14472713707204 is an frugal number, since it uses more digits than its factorization.
14472713707204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8324 (or 4162 counting only the distinct ones).
The product of its (nonzero) digits is 1843968, while the sum is 49.
Multiplying 14472713707204 by its sum of digits (49), we get a square (709162971652996 = 266301142).
The spelling of 14472713707204 in words is "fourteen trillion, four hundred seventy-two billion, seven hundred thirteen million, seven hundred seven thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •