Base | Representation |
---|---|
bin | 101100011000… |
… | …0110100111101 |
3 | 1121210011121120 |
4 | 1120300310331 |
5 | 21424044134 |
6 | 2150421153 |
7 | 401531454 |
oct | 130606475 |
9 | 47704546 |
10 | 23268669 |
11 | 12153106 |
12 | 79617b9 |
13 | 4a89158 |
14 | 3139b9b |
15 | 2099649 |
hex | 1630d3d |
23268669 has 4 divisors (see below), whose sum is σ = 31024896. Its totient is φ = 15512444.
The previous prime is 23268653. The next prime is 23268691. The reversal of 23268669 is 96686232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23268669 - 24 = 23268653 is a prime.
It is a super-2 number, since 2×232686692 = 1082861914063122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23268669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23268629) 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 3 ways as a sum of consecutive naturals, for example, 3878109 + ... + 3878114.
It is an arithmetic number, because the mean of its divisors is an integer number (7756224).
Almost surely, 223268669 is an apocalyptic number.
It is an amenable number.
23268669 is a deficient number, since it is larger than the sum of its proper divisors (7756227).
23268669 is an equidigital number, since it uses as much as digits as its factorization.
23268669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7756226.
The product of its digits is 186624, while the sum is 42.
The square root of 23268669 is about 4823.7608771580. The cubic root of 23268669 is about 285.4897458088.
The spelling of 23268669 in words is "twenty-three million, two hundred sixty-eight thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •