Base | Representation |
---|---|
bin | 11101011100001011111… |
… | …110111000111101000101 |
3 | 21011102001110012200222100 |
4 | 131130023332320331011 |
5 | 231121332420211010 |
6 | 4145225142422313 |
7 | 266111030430000 |
oct | 35341376707505 |
9 | 7142043180870 |
10 | 2023130632005 |
11 | 710006553a8a |
12 | 28811a431999 |
13 | 118a1b700882 |
14 | 6dcc4864537 |
15 | 3795d9e32c0 |
hex | 1d70bfb8f45 |
2023130632005 has 120 divisors (see below), whose sum is σ = 4160327988960. Its totient is φ = 909181264320.
The previous prime is 2023130631937. The next prime is 2023130632051. The reversal of 2023130632005 is 5002360313202.
2023130632005 is a `hidden beast` number, since 2 + 0 + 2 + 31 + 306 + 320 + 0 + 5 = 666.
It is not a de Polignac number, because 2023130632005 - 27 = 2023130631877 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2023130632005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 6215970 + ... + 6533340.
It is an arithmetic number, because the mean of its divisors is an integer number (34669399908).
Almost surely, 22023130632005 is an apocalyptic number.
It is an amenable number.
2023130632005 is an abundant number, since it is smaller than the sum of its proper divisors (2137197356955).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2023130632005 is an equidigital number, since it uses as much as digits as its factorization.
2023130632005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317469 (or 317445 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 2023130632005 its reverse (5002360313202), we get a palindrome (7025490945207).
The spelling of 2023130632005 in words is "two trillion, twenty-three billion, one hundred thirty million, six hundred thirty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •