Base | Representation |
---|---|
bin | 11110000010101010010… |
… | …10101111011010010000 |
3 | 10122200100020222100021201 |
4 | 33001111022233122100 |
5 | 113402442040430112 |
6 | 2110110143000544 |
7 | 134401253663053 |
oct | 17012512573220 |
9 | 3580306870251 |
10 | 1032221030032 |
11 | 368842952735 |
12 | 148074899154 |
13 | 7645184649a |
14 | 37d61844a9a |
15 | 1bcb5363257 |
hex | f0552af690 |
1032221030032 has 20 divisors (see below), whose sum is σ = 1999989741100. Its totient is φ = 516094645248.
The previous prime is 1032221029997. The next prime is 1032221030059. The reversal of 1032221030032 is 2300301222301.
It can be written as a sum of positive squares in 2 ways, for example, as 832247500176 + 199973529856 = 912276^2 + 447184^2 .
It is a super-3 number, since 3×10322210300323 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1032221029991 and 1032221030009.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 446157 + ... + 1504492.
It is an arithmetic number, because the mean of its divisors is an integer number (99999487055).
Almost surely, 21032221030032 is an apocalyptic number.
It is an amenable number.
1032221030032 is a deficient number, since it is larger than the sum of its proper divisors (967768711068).
1032221030032 is a wasteful number, since it uses less digits than its factorization.
1032221030032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1983730 (or 1983724 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1032221030032 its reverse (2300301222301), we get a palindrome (3332522252333).
The spelling of 1032221030032 in words is "one trillion, thirty-two billion, two hundred twenty-one million, thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •