Base | Representation |
---|---|
bin | 10110000010010101… |
… | …111001011111001111 |
3 | 2021002000111120211011 |
4 | 112002111321133033 |
5 | 341424333140210 |
6 | 14511530310051 |
7 | 1465233260311 |
oct | 260225713717 |
9 | 67060446734 |
10 | 23661615055 |
11 | a042401671 |
12 | 4704288327 |
13 | 230117bb70 |
14 | 12067137b1 |
15 | 93744dd8a |
hex | 5825797cf |
23661615055 has 32 divisors (see below), whose sum is σ = 31739355648. Its totient is φ = 16815859200.
The previous prime is 23661614989. The next prime is 23661615071. The reversal of 23661615055 is 55051616632.
It is a de Polignac number, because none of the positive numbers 2k-23661615055 is a prime.
It is a super-2 number, since 2×236616150552 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23661614999 and 23661615017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 332277 + ... + 397153.
It is an arithmetic number, because the mean of its divisors is an integer number (991854864).
Almost surely, 223661615055 is an apocalyptic number.
23661615055 is a deficient number, since it is larger than the sum of its proper divisors (8077740593).
23661615055 is a wasteful number, since it uses less digits than its factorization.
23661615055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65107.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 23661615055 in words is "twenty-three billion, six hundred sixty-one million, six hundred fifteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •