Base | Representation |
---|---|
bin | 11101010100110101000… |
… | …101100110010101100110 |
3 | 21010122122212101101001220 |
4 | 131110311011212111212 |
5 | 231004142430301042 |
6 | 4141441203401210 |
7 | 265411200051201 |
oct | 35246505462546 |
9 | 7118585341056 |
10 | 2015230322022 |
11 | 707721a86185 |
12 | 286694683206 |
13 | 11805ca23138 |
14 | 6d77550a938 |
15 | 3764a13a8ec |
hex | 1d535166566 |
2015230322022 has 8 divisors (see below), whose sum is σ = 4030460644056. Its totient is φ = 671743440672.
The previous prime is 2015230321999. The next prime is 2015230322047. The reversal of 2015230322022 is 2202230325102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2015230322022 is an admirable number.
It is a super-2 number, since 2×20152303220222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2015230321983 and 2015230322001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167935860163 + ... + 167935860174.
It is an arithmetic number, because the mean of its divisors is an integer number (503807580507).
Almost surely, 22015230322022 is an apocalyptic number.
2015230322022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2015230322022 is a wasteful number, since it uses less digits than its factorization.
2015230322022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335871720342.
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 2015230322022 its reverse (2202230325102), we get a palindrome (4217460647124).
The spelling of 2015230322022 in words is "two trillion, fifteen billion, two hundred thirty million, three hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •