Base | Representation |
---|---|
bin | 111100111110101… |
… | …1011001011101101 |
3 | 12021121011221121211 |
4 | 1321331123023231 |
5 | 13142303122021 |
6 | 535011554421 |
7 | 101463643036 |
oct | 17175331355 |
9 | 5247157554 |
10 | 2046145261 |
11 | 95aaa5246 |
12 | 4912bba11 |
13 | 267bb3054 |
14 | 155a6ba8d |
15 | be97a3e1 |
hex | 79f5b2ed |
2046145261 has 4 divisors (see below), whose sum is σ = 2048614300. Its totient is φ = 2043676224.
The previous prime is 2046145253. The next prime is 2046145291. The reversal of 2046145261 is 1625416402.
It is a happy number.
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 1024384036 + 1021761225 = 32006^2 + 31965^2 .
It is a cyclic number.
It is not a de Polignac number, because 2046145261 - 23 = 2046145253 is a prime.
It is a super-2 number, since 2×20461452612 = 8373420858225516242, which 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 (2046145291) 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, 1233276 + ... + 1234933.
It is an arithmetic number, because the mean of its divisors is an integer number (512153575).
Almost surely, 22046145261 is an apocalyptic number.
It is an amenable number.
2046145261 is a deficient number, since it is larger than the sum of its proper divisors (2469039).
2046145261 is an equidigital number, since it uses as much as digits as its factorization.
2046145261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2469038.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 2046145261 is about 45234.3371897942. The cubic root of 2046145261 is about 1269.5373645067.
The spelling of 2046145261 in words is "two billion, forty-six million, one hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •