Base | Representation |
---|---|
bin | 10110000000110100… |
… | …001101010110111011 |
3 | 2021000020022112020220 |
4 | 112000310031112323 |
5 | 341401304200311 |
6 | 14505213351123 |
7 | 1464502511310 |
oct | 260064152673 |
9 | 67006275226 |
10 | 23636006331 |
11 | a029a00433 |
12 | 46b77984a3 |
13 | 22c8a83882 |
14 | 1203168d07 |
15 | 935091206 |
hex | 580d0d5bb |
23636006331 has 16 divisors (see below), whose sum is σ = 36144048384. Its totient is φ = 13458560544.
The previous prime is 23636006311. The next prime is 23636006333. The reversal of 23636006331 is 13360063632.
It is not a de Polignac number, because 23636006331 - 29 = 23636005819 is a prime.
It is a super-2 number, since 2×236360063312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23636006292 and 23636006301.
It is not an unprimeable number, because it can be changed into a prime (23636006333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1982616 + ... + 1994501.
It is an arithmetic number, because the mean of its divisors is an integer number (2259003024).
Almost surely, 223636006331 is an apocalyptic number.
23636006331 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23636006331 is a deficient number, since it is larger than the sum of its proper divisors (12508042053).
23636006331 is a wasteful number, since it uses less digits than its factorization.
23636006331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3977410.
The product of its (nonzero) digits is 34992, while the sum is 33.
Adding to 23636006331 its reverse (13360063632), we get a palindrome (36996069963).
The spelling of 23636006331 in words is "twenty-three billion, six hundred thirty-six million, six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •