Base | Representation |
---|---|
bin | 1010101100000010011011… |
… | …01001000011001000010001 |
3 | 10002012220021211020121210102 |
4 | 11112001031221003020101 |
5 | 11040034342043300230 |
6 | 121553143551342145 |
7 | 4644030155506325 |
oct | 526011551031021 |
9 | 102186254217712 |
10 | 23503363650065 |
11 | 75417a205a2a2 |
12 | 2777138b21955 |
13 | 1016485a9b190 |
14 | 5b37d6da1985 |
15 | 2ab59a685045 |
hex | 15604da43211 |
23503363650065 has 16 divisors (see below), whose sum is σ = 32160258679248. Its totient is φ = 16335369486336.
The previous prime is 23503363650059. The next prime is 23503363650113. The reversal of 23503363650065 is 56005636330532.
It can be written as a sum of positive squares in 8 ways, for example, as 1730771785744 + 21772591864321 = 1315588^2 + 4666111^2 .
It is a cyclic number.
It is not a de Polignac number, because 23503363650065 - 28 = 23503363649809 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 10635005072 + ... + 10635007281.
It is an arithmetic number, because the mean of its divisors is an integer number (2010016167453).
Almost surely, 223503363650065 is an apocalyptic number.
It is an amenable number.
23503363650065 is a deficient number, since it is larger than the sum of its proper divisors (8656895029183).
23503363650065 is a wasteful number, since it uses less digits than its factorization.
23503363650065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21270012388.
The product of its (nonzero) digits is 4374000, while the sum is 47.
Adding to 23503363650065 its reverse (56005636330532), we get a palindrome (79508999980597).
The spelling of 23503363650065 in words is "twenty-three trillion, five hundred three billion, three hundred sixty-three million, six hundred fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •