Base | Representation |
---|---|
bin | 10010110101111010… |
… | …111101001100000101 |
3 | 1221020000002002210000 |
4 | 102311322331030011 |
5 | 312413343002021 |
6 | 13143333551513 |
7 | 1314240110334 |
oct | 226572751405 |
9 | 57200062700 |
10 | 20232000261 |
11 | 8642489280 |
12 | 3b077a5599 |
13 | 1ba57874b5 |
14 | d9d037d1b |
15 | 7d62e6b26 |
hex | 4b5ebd305 |
20232000261 has 160 divisors (see below), whose sum is σ = 36024468480. Its totient is φ = 11183443200.
The previous prime is 20232000241. The next prime is 20232000287. The reversal of 20232000261 is 16200023202.
20232000261 is a `hidden beast` number, since 202 + 3 + 200 + 0 + 261 = 666.
It is not a de Polignac number, because 20232000261 - 26 = 20232000197 is a prime.
It is a super-2 number, since 2×202320002612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20232000211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 71491026 + ... + 71491308.
It is an arithmetic number, because the mean of its divisors is an integer number (225152928).
Almost surely, 220232000261 is an apocalyptic number.
It is an amenable number.
20232000261 is a deficient number, since it is larger than the sum of its proper divisors (15792468219).
20232000261 is a wasteful number, since it uses less digits than its factorization.
20232000261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469 (or 460 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20232000261 its reverse (16200023202), we get a palindrome (36432023463).
The spelling of 20232000261 in words is "twenty billion, two hundred thirty-two million, two hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •