Base | Representation |
---|---|
bin | 11101111011101000100… |
… | …01110000101101100001 |
3 | 10122022121022100101200000 |
4 | 32331310101300231201 |
5 | 113322230141344034 |
6 | 2104243521450213 |
7 | 134205620510064 |
oct | 16756421605541 |
9 | 3568538311600 |
10 | 1028447996769 |
11 | 36718709aa26 |
12 | 1473a11a0969 |
13 | 75c9cc6151b |
14 | 37ac46d28db |
15 | 1bb43ec2599 |
hex | ef74470b61 |
1028447996769 has 12 divisors (see below), whose sum is σ = 1540555847376. Its totient is φ = 685631997684.
The previous prime is 1028447996713. The next prime is 1028447996809. The reversal of 1028447996769 is 9676997448201.
1028447996769 is a `hidden beast` number, since 1 + 0 + 2 + 8 + 4 + 479 + 96 + 7 + 69 = 666.
It is not a de Polignac number, because 1028447996769 - 212 = 1028447992673 is a prime.
It is a super-2 number, since 2×10284479967692 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1028447996697 and 1028447996706.
It is not an unprimeable number, because it can be changed into a prime (1028447996369) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2116147899 + ... + 2116148384.
It is an arithmetic number, because the mean of its divisors is an integer number (128379653948).
Almost surely, 21028447996769 is an apocalyptic number.
It is an amenable number.
1028447996769 is a deficient number, since it is larger than the sum of its proper divisors (512107850607).
1028447996769 is an frugal number, since it uses more digits than its factorization.
1028447996769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4232296298 (or 4232296286 counting only the distinct ones).
The product of its (nonzero) digits is 329204736, while the sum is 72.
The spelling of 1028447996769 in words is "one trillion, twenty-eight billion, four hundred forty-seven million, nine hundred ninety-six thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •