Base | Representation |
---|---|
bin | 10011110001110101… |
… | …010000111000101001 |
3 | 2000211001102112201000 |
4 | 103301311100320221 |
5 | 321443202003113 |
6 | 13431201345213 |
7 | 1351163502033 |
oct | 236165207051 |
9 | 60731375630 |
10 | 21237141033 |
11 | 90088a3429 |
12 | 4148338209 |
13 | 2005aa4554 |
14 | 1056722c53 |
15 | 844691373 |
hex | 4f1d50e29 |
21237141033 has 16 divisors (see below), whose sum is σ = 31978211200. Its totient is φ = 13925993040.
The previous prime is 21237141031. The next prime is 21237141053. The reversal of 21237141033 is 33014173212.
It is a happy number.
21237141033 is a `hidden beast` number, since 212 + 3 + 7 + 1 + 410 + 33 = 666.
It is not a de Polignac number, because 21237141033 - 21 = 21237141031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21237140988 and 21237141006.
It is not an unprimeable number, because it can be changed into a prime (21237141031) by changing a digit.
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, 6445573 + ... + 6448866.
It is an arithmetic number, because the mean of its divisors is an integer number (1998638200).
Almost surely, 221237141033 is an apocalyptic number.
It is an amenable number.
21237141033 is a deficient number, since it is larger than the sum of its proper divisors (10741070167).
21237141033 is a wasteful number, since it uses less digits than its factorization.
21237141033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12894509 (or 12894503 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The spelling of 21237141033 in words is "twenty-one billion, two hundred thirty-seven million, one hundred forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •