Base | Representation |
---|---|
bin | 11111000001100101000… |
… | …11100000000010110110 |
3 | 10202220112101011200102011 |
4 | 33200302203200002312 |
5 | 114431132003302002 |
6 | 2133414052434434 |
7 | 140005321655563 |
oct | 17406243400266 |
9 | 3686471150364 |
10 | 1066000056502 |
11 | 3810a7272237 |
12 | 152721318a1a |
13 | 796a5b11404 |
14 | 39847b2186a |
15 | 1cae0b138d7 |
hex | f8328e00b6 |
1066000056502 has 64 divisors (see below), whose sum is σ = 1698539673600. Its totient is φ = 500933184640.
The previous prime is 1066000056487. The next prime is 1066000056599. The reversal of 1066000056502 is 2056500006601.
It is a super-2 number, since 2×10660000565022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 846703149 + ... + 846704407.
It is an arithmetic number, because the mean of its divisors is an integer number (26539682400).
Almost surely, 21066000056502 is an apocalyptic number.
1066000056502 is a deficient number, since it is larger than the sum of its proper divisors (632539617098).
1066000056502 is a wasteful number, since it uses less digits than its factorization.
1066000056502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2781.
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 1066000056502 in words is "one trillion, sixty-six billion, fifty-six thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •