Base | Representation |
---|---|
bin | 10101110110101010… |
… | …000111111001100001 |
3 | 2020120100122111111121 |
4 | 111312222013321201 |
5 | 341024142342434 |
6 | 14440245012241 |
7 | 1460333140624 |
oct | 256652077141 |
9 | 66510574447 |
10 | 23465590369 |
11 | 9a517943a1 |
12 | 466a6b4081 |
13 | 229c687120 |
14 | 11c8687dbb |
15 | 92512c7b4 |
hex | 576a87e61 |
23465590369 has 4 divisors (see below), whose sum is σ = 25270635796. Its totient is φ = 21660544944.
The previous prime is 23465590361. The next prime is 23465590373. The reversal of 23465590369 is 96309556432.
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 15144501969 + 8321088400 = 123063^2 + 91220^2 .
It is a cyclic number.
It is not a de Polignac number, because 23465590369 - 23 = 23465590361 is a prime.
It is a super-2 number, since 2×234655903692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23465590361) 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 3 ways as a sum of consecutive naturals, for example, 902522694 + ... + 902522719.
It is an arithmetic number, because the mean of its divisors is an integer number (6317658949).
Almost surely, 223465590369 is an apocalyptic number.
It is an amenable number.
23465590369 is a deficient number, since it is larger than the sum of its proper divisors (1805045427).
23465590369 is a wasteful number, since it uses less digits than its factorization.
23465590369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805045426.
The product of its (nonzero) digits is 5248800, while the sum is 52.
The spelling of 23465590369 in words is "twenty-three billion, four hundred sixty-five million, five hundred ninety thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •