Base | Representation |
---|---|
bin | 10100000010111111… |
… | …110100111111011001 |
3 | 2001120010022112202000 |
4 | 110002333310333121 |
5 | 323040412414113 |
6 | 13515530031213 |
7 | 1361261345511 |
oct | 240277647731 |
9 | 61503275660 |
10 | 21525123033 |
11 | 9146409587 |
12 | 4208878509 |
13 | 20506550bb |
14 | 1082a88841 |
15 | 85eac9373 |
hex | 502ff4fd9 |
21525123033 has 16 divisors (see below), whose sum is σ = 31899591360. Its totient is φ = 14345347968.
The previous prime is 21525123023. The next prime is 21525123043. The reversal of 21525123033 is 33032152512.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (21525123023) and next prime (21525123043).
It is not a de Polignac number, because 21525123033 - 222 = 21520928729 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 21525122988 and 21525123006.
It is not an unprimeable number, because it can be changed into a prime (21525123013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47160 + ... + 212777.
It is an arithmetic number, because the mean of its divisors is an integer number (1993724460).
Almost surely, 221525123033 is an apocalyptic number.
It is an amenable number.
21525123033 is a deficient number, since it is larger than the sum of its proper divisors (10374468327).
21525123033 is a wasteful number, since it uses less digits than its factorization.
21525123033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263013 (or 263007 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 21525123033 its reverse (33032152512), we get a palindrome (54557275545).
The spelling of 21525123033 in words is "twenty-one billion, five hundred twenty-five million, one hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •