Base | Representation |
---|---|
bin | 10010110001000110… |
… | …000000110010110101 |
3 | 1221000100200111111112 |
4 | 102301012000302311 |
5 | 312232124400113 |
6 | 13131322044405 |
7 | 1312234531451 |
oct | 226106006265 |
9 | 57010614445 |
10 | 20151012533 |
11 | 86007a2a73 |
12 | 3aa4649705 |
13 | 1b91a6c672 |
14 | d92395661 |
15 | 7ce14a5a8 |
hex | 4b1180cb5 |
20151012533 has 8 divisors (see below), whose sum is σ = 21228600000. Its totient is φ = 19075125888.
The previous prime is 20151012523. The next prime is 20151012547. The reversal of 20151012533 is 33521015102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20151012533 - 210 = 20151011509 is a prime.
It is a super-2 number, since 2×201510125332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20151012499 and 20151012508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20151012523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 400841 + ... + 448302.
It is an arithmetic number, because the mean of its divisors is an integer number (2653575000).
Almost surely, 220151012533 is an apocalyptic number.
It is an amenable number.
20151012533 is a deficient number, since it is larger than the sum of its proper divisors (1077587467).
20151012533 is a wasteful number, since it uses less digits than its factorization.
20151012533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850411.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 20151012533 its reverse (33521015102), we get a palindrome (53672027635).
The spelling of 20151012533 in words is "twenty billion, one hundred fifty-one million, twelve thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •