Base | Representation |
---|---|
bin | 11110101111001010001… |
… | …11111011110100010001 |
3 | 10201222000012021002202010 |
4 | 33113211013323310101 |
5 | 114300403412100001 |
6 | 2125100513013133 |
7 | 136205262544050 |
oct | 17274507736421 |
9 | 3658005232663 |
10 | 1056111050001 |
11 | 377992178297 |
12 | 1508215541a9 |
13 | 7878b116587 |
14 | 3918a612397 |
15 | 1c71287c8d6 |
hex | f5e51fbd11 |
1056111050001 has 16 divisors (see below), whose sum is σ = 1609799704448. Its totient is φ = 603309168000.
The previous prime is 1056111049979. The next prime is 1056111050017. The reversal of 1056111050001 is 1000501116501.
It is a happy number.
It is not a de Polignac number, because 1056111050001 - 25 = 1056111049969 is a prime.
It is a super-2 number, since 2×10561110500012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 1056111050001.
It is not an unprimeable number, because it can be changed into a prime (1056111050101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7548220 + ... + 7686861.
It is an arithmetic number, because the mean of its divisors is an integer number (100612481528).
Almost surely, 21056111050001 is an apocalyptic number.
It is an amenable number.
1056111050001 is a deficient number, since it is larger than the sum of its proper divisors (553688654447).
1056111050001 is a wasteful number, since it uses less digits than its factorization.
1056111050001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15238392.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 1056111050001 its reverse (1000501116501), we get a palindrome (2056612166502).
The spelling of 1056111050001 in words is "one trillion, fifty-six billion, one hundred eleven million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •