Base | Representation |
---|---|
bin | 111110110000110110001… |
… | …101100111011001100100 |
3 | 120021022202100010000112121 |
4 | 332300312031213121210 |
5 | 1031131120004012400 |
6 | 13101220233355324 |
7 | 623415365042254 |
oct | 76606615473144 |
9 | 16238670100477 |
10 | 4313056704100 |
11 | 1413180082a11 |
12 | 597a95b68b44 |
13 | 253947990a51 |
14 | 10ca7856b964 |
15 | 772d4a6c21a |
hex | 3ec36367664 |
4313056704100 has 27 divisors (see below), whose sum is σ = 9359378114457. Its totient is φ = 1725214374480.
The previous prime is 4313056704097. The next prime is 4313056704101. The reversal of 4313056704100 is 14076503134.
The square root of 4313056704100 is 2076790.
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., 1552700413476 + 2760356290624 = 1246074^2 + 1661432^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4313056704101) by changing a digit.
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, 20664061 + ... + 20871739.
Almost surely, 24313056704100 is an apocalyptic number.
4313056704100 is the 2076790-th square number.
It is an amenable number.
4313056704100 is an abundant number, since it is smaller than the sum of its proper divisors (5046321410357).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4313056704100 is an frugal number, since it uses more digits than its factorization.
4313056704100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415372 (or 207686 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 34.
The spelling of 4313056704100 in words is "four trillion, three hundred thirteen billion, fifty-six million, seven hundred four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •