Base | Representation |
---|---|
bin | 11110110110101100010… |
… | …10100100100010010100 |
3 | 10202100110000202121000202 |
4 | 33123112022210202110 |
5 | 114332144143101012 |
6 | 2131010054000032 |
7 | 136410426145643 |
oct | 17332612444224 |
9 | 3670400677022 |
10 | 1060155050132 |
11 | 379677984462 |
12 | 15156b946018 |
13 | 78c83ba2469 |
14 | 3945173b35a |
15 | 1c89c8e4cc2 |
hex | f6d62a4894 |
1060155050132 has 24 divisors (see below), whose sum is σ = 1859637462816. Its totient is φ = 528830291808.
The previous prime is 1060155050089. The next prime is 1060155050147. The reversal of 1060155050132 is 2310505510601.
It is a super-2 number, since 2×10601550501322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1060155050095 and 1060155050104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24295358 + ... + 24338954.
It is an arithmetic number, because the mean of its divisors is an integer number (77484894284).
Almost surely, 21060155050132 is an apocalyptic number.
It is an amenable number.
1060155050132 is a deficient number, since it is larger than the sum of its proper divisors (799482412684).
1060155050132 is a wasteful number, since it uses less digits than its factorization.
1060155050132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57767 (or 57765 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 1060155050132 in words is "one trillion, sixty billion, one hundred fifty-five million, fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •