Base | Representation |
---|---|
bin | 10101100001011000… |
… | …000010101101000001 |
3 | 2012122110202220100000 |
4 | 111201120002231001 |
5 | 334311240411321 |
6 | 14341011550213 |
7 | 1445436153360 |
oct | 254130025501 |
9 | 65573686300 |
10 | 23108528961 |
11 | 9889186921 |
12 | 458abbb369 |
13 | 22436caa9b |
14 | 119309d7d7 |
15 | 903aeb826 |
hex | 561602b41 |
23108528961 has 96 divisors (see below), whose sum is σ = 41981442048. Its totient is φ = 12400231680.
The previous prime is 23108528953. The next prime is 23108528999. The reversal of 23108528961 is 16982580132.
23108528961 is a `hidden beast` number, since 2 + 31 + 0 + 8 + 528 + 96 + 1 = 666.
It is not a de Polignac number, because 23108528961 - 23 = 23108528953 is a prime.
It is a super-2 number, since 2×231085289612 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23108528951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23798206 + ... + 23799176.
It is an arithmetic number, because the mean of its divisors is an integer number (437306688).
Almost surely, 223108528961 is an apocalyptic number.
23108528961 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
23108528961 is a deficient number, since it is larger than the sum of its proper divisors (18872913087).
23108528961 is an equidigital number, since it uses as much as digits as its factorization.
23108528961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1833 (or 1821 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 45.
The spelling of 23108528961 in words is "twenty-three billion, one hundred eight million, five hundred twenty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •