Base | Representation |
---|---|
bin | 11110101111011101111… |
… | …10110100110101111101 |
3 | 10201222102201110111100120 |
4 | 33113232332310311331 |
5 | 114301223231344201 |
6 | 2125125141445153 |
7 | 136212341360034 |
oct | 17275676646575 |
9 | 3658381414316 |
10 | 1056276434301 |
11 | 377a67567a30 |
12 | 150868a107b9 |
13 | 787b64709ca |
14 | 391a458371b |
15 | 1c72214a536 |
hex | f5eefb4d7d |
1056276434301 has 64 divisors (see below), whose sum is σ = 1590005894400. Its totient is φ = 618165043200.
The previous prime is 1056276434299. The next prime is 1056276434347. The reversal of 1056276434301 is 1034346726501.
It is not a de Polignac number, because 1056276434301 - 21 = 1056276434299 is a prime.
It is a super-2 number, since 2×10562764343012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056276434401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 161779005 + ... + 161785533.
It is an arithmetic number, because the mean of its divisors is an integer number (24843842100).
Almost surely, 21056276434301 is an apocalyptic number.
1056276434301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1056276434301 is a deficient number, since it is larger than the sum of its proper divisors (533729460099).
1056276434301 is a wasteful number, since it uses less digits than its factorization.
1056276434301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7790.
The product of its (nonzero) digits is 362880, while the sum is 42.
The spelling of 1056276434301 in words is "one trillion, fifty-six billion, two hundred seventy-six million, four hundred thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •