Base | Representation |
---|---|
bin | 11110111111111111111… |
… | …01000000110001000000 |
3 | 10202211100012201112102010 |
4 | 33133333331000301000 |
5 | 114422412140343422 |
6 | 2133153524452520 |
7 | 136645303005552 |
oct | 17377775006100 |
9 | 3684305645363 |
10 | 1065151106112 |
11 | 380801038245 |
12 | 152524b4a140 |
13 | 7959bc7cac2 |
14 | 397a70934d2 |
15 | 1ca9131cb0c |
hex | f7fff40c40 |
1065151106112 has 56 divisors (see below), whose sum is σ = 2835087909696. Its totient is φ = 352924307968.
The previous prime is 1065151106099. The next prime is 1065151106137. The reversal of 1065151106112 is 2116011515601.
It is a super-2 number, since 2×10651511061122 (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 1065151106112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16577703 + ... + 16641830.
It is an arithmetic number, because the mean of its divisors is an integer number (50626569816).
Almost surely, 21065151106112 is an apocalyptic number.
1065151106112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1065151106112 is an abundant number, since it is smaller than the sum of its proper divisors (1769936803584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1065151106112 is a wasteful number, since it uses less digits than its factorization.
1065151106112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33219715 (or 33219705 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 30.
The spelling of 1065151106112 in words is "one trillion, sixty-five billion, one hundred fifty-one million, one hundred six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •