Base | Representation |
---|---|
bin | 1001101100100001100001… |
… | …00111100000101001001000 |
3 | 2210111021022110201101002222 |
4 | 10312100300213200221020 |
5 | 10243310434012233112 |
6 | 113202425242513212 |
7 | 4330252040001044 |
oct | 466206047405110 |
9 | 83437273641088 |
10 | 21321033321032 |
11 | 6880221520675 |
12 | 24841aab05808 |
13 | bb8745b8b763 |
14 | 539d2d031024 |
15 | 26e9205db372 |
hex | 1364309e0a48 |
21321033321032 has 16 divisors (see below), whose sum is σ = 40951984733100. Its totient is φ = 10400504058880.
The previous prime is 21321033321023. The next prime is 21321033321059. The reversal of 21321033321032 is 23012333012312.
It can be written as a sum of positive squares in 2 ways, for example, as 21113602262116 + 207431058916 = 4594954^2 + 455446^2 .
It is a super-3 number, since 3×213210333210323 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21321033320992 and 21321033321010.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 32501574857 + ... + 32501575512.
Almost surely, 221321033321032 is an apocalyptic number.
It is an amenable number.
21321033321032 is a deficient number, since it is larger than the sum of its proper divisors (19630951412068).
21321033321032 is a wasteful number, since it uses less digits than its factorization.
21321033321032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65003150416 (or 65003150412 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 21321033321032 its reverse (23012333012312), we get a palindrome (44333366333344).
The spelling of 21321033321032 in words is "twenty-one trillion, three hundred twenty-one billion, thirty-three million, three hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •