Base | Representation |
---|---|
bin | 11110101111001001101… |
… | …00101011001010011011 |
3 | 10201221222211202120212222 |
4 | 33113210310223022123 |
5 | 114300401114013201 |
6 | 2125100212454255 |
7 | 136205201615063 |
oct | 17274464531233 |
9 | 3657884676788 |
10 | 1056106001051 |
11 | 37798a339a02 |
12 | 15081b91a38b |
13 | 7878a06942a |
14 | 39189a9a3a3 |
15 | 1c7121d191b |
hex | f5e4d2b29b |
1056106001051 has 8 divisors (see below), whose sum is σ = 1059119277840. Its totient is φ = 1053095938048.
The previous prime is 1056106000997. The next prime is 1056106001117. The reversal of 1056106001051 is 1501006016501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1056106001051 - 226 = 1056038892187 is a prime.
It is a super-2 number, since 2×10561060010512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1056106001051.
It is not an unprimeable number, because it can be changed into a prime (1056106001551) by changing a digit.
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, 144506 + ... + 1460511.
It is an arithmetic number, because the mean of its divisors is an integer number (132389909730).
Almost surely, 21056106001051 is an apocalyptic number.
1056106001051 is a deficient number, since it is larger than the sum of its proper divisors (3013276789).
1056106001051 is a wasteful number, since it uses less digits than its factorization.
1056106001051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1606893.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 1056106001051 in words is "one trillion, fifty-six billion, one hundred six million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •