Base | Representation |
---|---|
bin | 11111100000001111110… |
… | …11011001001010100000 |
3 | 10211111000211102201110121 |
4 | 33300013323121022200 |
5 | 120213341440044142 |
6 | 2145135532410024 |
7 | 141130325502100 |
oct | 17600773311240 |
9 | 3744024381417 |
10 | 1082464768672 |
11 | 388086162181 |
12 | 155957316914 |
13 | 7b0cac45951 |
14 | 3a56a6a1200 |
15 | 1d256301c67 |
hex | fc07ed92a0 |
1082464768672 has 36 divisors (see below), whose sum is σ = 2479037621130. Its totient is φ = 463913471616.
The previous prime is 1082464768663. The next prime is 1082464768717. The reversal of 1082464768672 is 2768674642801.
1082464768672 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., 1031191506576 + 51273262096 = 1015476^2 + 226436^2 .
It is a super-2 number, since 2×10824647686722 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1082464768672.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 345172147 + ... + 345175282.
Almost surely, 21082464768672 is an apocalyptic number.
It is an amenable number.
1082464768672 is an abundant number, since it is smaller than the sum of its proper divisors (1396572852458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1082464768672 is an equidigital number, since it uses as much as digits as its factorization.
1082464768672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 690347453 (or 690347438 counting only the distinct ones).
The product of its (nonzero) digits is 43352064, while the sum is 61.
The spelling of 1082464768672 in words is "one trillion, eighty-two billion, four hundred sixty-four million, seven hundred sixty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •