Base | Representation |
---|---|
bin | 10000110100110011110… |
… | …110100111000001100101 |
3 | 11002112101200200101200021 |
4 | 100310303312213001211 |
5 | 122420412314000021 |
6 | 2243054112515141 |
7 | 146351054112565 |
oct | 20646366470145 |
9 | 4075350611607 |
10 | 1156216156261 |
11 | 406391972271 |
12 | 1680ba54bab1 |
13 | 85052636a6a |
14 | 3dd655d2da5 |
15 | 20120e29c41 |
hex | 10d33da7065 |
1156216156261 has 4 divisors (see below), whose sum is σ = 1157362060300. Its totient is φ = 1155070252224.
The previous prime is 1156216156231. The next prime is 1156216156273. The reversal of 1156216156261 is 1626516126511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 514124850625 + 642091305636 = 717025^2 + 801306^2 .
It is a cyclic number.
It is not a de Polignac number, because 1156216156261 - 27 = 1156216156133 is a prime.
It is a super-2 number, since 2×11562161562612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1156216156201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 572950506 + ... + 572952523.
It is an arithmetic number, because the mean of its divisors is an integer number (289340515075).
Almost surely, 21156216156261 is an apocalyptic number.
It is an amenable number.
1156216156261 is a deficient number, since it is larger than the sum of its proper divisors (1145904039).
1156216156261 is a wasteful number, since it uses less digits than its factorization.
1156216156261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1145904038.
The product of its digits is 129600, while the sum is 43.
The spelling of 1156216156261 in words is "one trillion, one hundred fifty-six billion, two hundred sixteen million, one hundred fifty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •