Base | Representation |
---|---|
bin | 101100011000… |
… | …1000111010010 |
3 | 1121210020020000 |
4 | 1120301013102 |
5 | 21424113332 |
6 | 2150430430 |
7 | 401535051 |
oct | 130610722 |
9 | 47706200 |
10 | 23269842 |
11 | 12153a82 |
12 | 7962416 |
13 | 4a8984b |
14 | 313a398 |
15 | 2099b7c |
hex | 16311d2 |
23269842 has 30 divisors (see below), whose sum is σ = 52279623. Its totient is φ = 7736148.
The previous prime is 23269823. The next prime is 23269843. The reversal of 23269842 is 24896232.
It can be written as a sum of positive squares in only one way, i.e., 11634921 + 11634921 = 3411^2 + 3411^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=3411.
Its product of digits (41472) is a multiple of the sum of its prime divisors (384).
It is a junction number, because it is equal to n+sod(n) for n = 23269797 and 23269806.
It is not an unprimeable number, because it can be changed into a prime (23269843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 61209 + ... + 61587.
Almost surely, 223269842 is an apocalyptic number.
23269842 is an abundant number, since it is smaller than the sum of its proper divisors (29009781).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23269842 is an frugal number, since it uses more digits than its factorization.
23269842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772 (or 384 counting only the distinct ones).
The product of its digits is 41472, while the sum is 36.
The square root of 23269842 is about 4823.8824612546. The cubic root of 23269842 is about 285.4945430155.
Multiplying 23269842 by its product of digits (41472), we get a square (965046887424 = 9823682).
The spelling of 23269842 in words is "twenty-three million, two hundred sixty-nine thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •