Base | Representation |
---|---|
bin | 1001100011110000111111… |
… | …00110011010011010111010 |
3 | 2202102111112220210022111200 |
4 | 10301320133212122122322 |
5 | 10223343131112010020 |
6 | 112412300051435030 |
7 | 4266436450625511 |
oct | 461703746323272 |
9 | 82374486708450 |
10 | 21020100110010 |
11 | 67746355790a1 |
12 | 2435a04bb5a76 |
13 | b96257908aa1 |
14 | 529541da9678 |
15 | 266bab040590 |
hex | 131e1f99a6ba |
21020100110010 has 48 divisors (see below), whose sum is σ = 54729344035080. Its totient is φ = 5597454003840.
The previous prime is 21020100109949. The next prime is 21020100110011. The reversal of 21020100110010 is 1001100102012.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9504821174121 + 11515278935889 = 3082989^2 + 3393417^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 21020100109974 and 21020100110001.
It is not an unprimeable number, because it can be changed into a prime (21020100110011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 164644701 + ... + 164772320.
Almost surely, 221020100110010 is an apocalyptic number.
21020100110010 is an abundant number, since it is smaller than the sum of its proper divisors (33709243925070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21020100110010 is a wasteful number, since it uses less digits than its factorization.
21020100110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329417743 (or 329417740 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 21020100110010 its reverse (1001100102012), we get a palindrome (22021200212022).
The spelling of 21020100110010 in words is "twenty-one trillion, twenty billion, one hundred million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •