Base | Representation |
---|---|
bin | 111110010101010011010… |
… | …000111011000111010000 |
3 | 120011111102001002012220102 |
4 | 332111103100323013100 |
5 | 1030140031202330342 |
6 | 13035445300031532 |
7 | 621320416431434 |
oct | 76252320730720 |
9 | 16144361065812 |
10 | 4283479339472 |
11 | 1401682465113 |
12 | 5922006925a8 |
13 | 250c13034068 |
14 | 10b4702da9c4 |
15 | 766530c8832 |
hex | 3e55343b1d0 |
4283479339472 has 10 divisors (see below), whose sum is σ = 8299241220258. Its totient is φ = 2141739669728.
The previous prime is 4283479339471. The next prime is 4283479339501. The reversal of 4283479339472 is 2749339743824.
4283479339472 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 3106462650256 + 1177016689216 = 1762516^2 + 1084904^2 .
It is a super-3 number, since 3×42834793394723 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4283479339399 and 4283479339408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4283479339471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133858729343 + ... + 133858729374.
Almost surely, 24283479339472 is an apocalyptic number.
It is an amenable number.
4283479339472 is a deficient number, since it is larger than the sum of its proper divisors (4015761880786).
4283479339472 is a wasteful number, since it uses less digits than its factorization.
4283479339472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267717458725 (or 267717458719 counting only the distinct ones).
The product of its digits is 219469824, while the sum is 65.
The spelling of 4283479339472 in words is "four trillion, two hundred eighty-three billion, four hundred seventy-nine million, three hundred thirty-nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •