Base | Representation |
---|---|
bin | 11101101101111100101… |
… | …00100110100100001000 |
3 | 10121121122020101210102121 |
4 | 32312332110212210020 |
5 | 113212203140233112 |
6 | 2101030443341024 |
7 | 133525550343661 |
oct | 16667624464410 |
9 | 3547566353377 |
10 | 1021100321032 |
11 | 364056569440 |
12 | 145a90521774 |
13 | 7539b9072bc |
14 | 375c8912368 |
15 | 1b863dcd407 |
hex | edbe526908 |
1021100321032 has 32 divisors (see below), whose sum is σ = 2091062998080. Its totient is φ = 463592352960.
The previous prime is 1021100321011. The next prime is 1021100321099. The reversal of 1021100321032 is 2301230011201.
1021100321032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10211003210322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1021100320997 and 1021100321015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6726468 + ... + 6876595.
It is an arithmetic number, because the mean of its divisors is an integer number (65345718690).
Almost surely, 21021100321032 is an apocalyptic number.
It is an amenable number.
1021100321032 is an abundant number, since it is smaller than the sum of its proper divisors (1069962677048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021100321032 is a wasteful number, since it uses less digits than its factorization.
1021100321032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13603933 (or 13603929 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1021100321032 its reverse (2301230011201), we get a palindrome (3322330332233).
The spelling of 1021100321032 in words is "one trillion, twenty-one billion, one hundred million, three hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •