Base | Representation |
---|---|
bin | 100000111101000001010… |
… | …010111011011101001011 |
3 | 22000111011220122011021211 |
4 | 200331001102323131023 |
5 | 244100241032334110 |
6 | 4452152232513551 |
7 | 322415330665261 |
oct | 40750122733513 |
9 | 8014156564254 |
10 | 2264543246155 |
11 | 7a3429698133 |
12 | 306a72b4b8b7 |
13 | 135712649458 |
14 | 7b86698a431 |
15 | 3dd8c98698a |
hex | 20f414bb74b |
2264543246155 has 8 divisors (see below), whose sum is σ = 2719741246992. Its totient is φ = 1810108362528.
The previous prime is 2264543246143. The next prime is 2264543246171. The reversal of 2264543246155 is 5516423454622.
2264543246155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2264543246155 - 211 = 2264543244107 is a prime.
It is a super-2 number, since 2×22645432461552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2264543246099 and 2264543246108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190772772 + ... + 190784641.
It is an arithmetic number, because the mean of its divisors is an integer number (339967655874).
Almost surely, 22264543246155 is an apocalyptic number.
2264543246155 is a deficient number, since it is larger than the sum of its proper divisors (455198000837).
2264543246155 is a wasteful number, since it uses less digits than its factorization.
2264543246155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381558605.
The product of its digits is 6912000, while the sum is 49.
The spelling of 2264543246155 in words is "two trillion, two hundred sixty-four billion, five hundred forty-three million, two hundred forty-six thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •