Base | Representation |
---|---|
bin | 11111000010110100101… |
… | …11000101101010101101 |
3 | 10202222020220211012122000 |
4 | 33201122113011222231 |
5 | 114434013440010443 |
6 | 2134004230442513 |
7 | 140031011323200 |
oct | 17413227055255 |
9 | 3688226735560 |
10 | 1066667891373 |
11 | 38140a242487 |
12 | 152888b03439 |
13 | 7978129b186 |
14 | 398ac6c5937 |
15 | 1cb2e5808d3 |
hex | f85a5c5aad |
1066667891373 has 48 divisors (see below), whose sum is σ = 1887930999360. Its totient is φ = 593050846752.
The previous prime is 1066667891371. The next prime is 1066667891407. The reversal of 1066667891373 is 3731987666601.
It is not a de Polignac number, because 1066667891373 - 21 = 1066667891371 is a prime.
It is a super-2 number, since 2×10666678913732 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 1066667891373.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066667891371) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10846311 + ... + 10944212.
It is an arithmetic number, because the mean of its divisors is an integer number (39331895820).
Almost surely, 21066667891373 is an apocalyptic number.
It is an amenable number.
1066667891373 is a deficient number, since it is larger than the sum of its proper divisors (821263107987).
1066667891373 is a wasteful number, since it uses less digits than its factorization.
1066667891373 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21790583 (or 21790570 counting only the distinct ones).
The product of its (nonzero) digits is 41150592, while the sum is 63.
The spelling of 1066667891373 in words is "one trillion, sixty-six billion, six hundred sixty-seven million, eight hundred ninety-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •