Base | Representation |
---|---|
bin | 1001100011110001000011… |
… | …00000011111101001101010 |
3 | 2202102111122011000020100200 |
4 | 10301320201200133221222 |
5 | 10223343212310104002 |
6 | 112412303153413030 |
7 | 4266440316635631 |
oct | 461704140375152 |
9 | 82374564006320 |
10 | 21020132113002 |
11 | 6774651647450 |
12 | 2435a1386a176 |
13 | b96261432679 |
14 | 52954633a518 |
15 | 266badc62b1c |
hex | 131e2181fa6a |
21020132113002 has 24 divisors (see below), whose sum is σ = 49683948631200. Its totient is φ = 6369737003880.
The previous prime is 21020132112943. The next prime is 21020132113051. The reversal of 21020132113002 is 20031123102012.
21020132113002 is a `hidden beast` number, since 2 + 10 + 201 + 321 + 130 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53081141502 + ... + 53081141897.
It is an arithmetic number, because the mean of its divisors is an integer number (2070164526300).
Almost surely, 221020132113002 is an apocalyptic number.
21020132113002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21020132113002 is an abundant number, since it is smaller than the sum of its proper divisors (28663816518198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21020132113002 is a wasteful number, since it uses less digits than its factorization.
21020132113002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106162283418 (or 106162283415 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 21020132113002 its reverse (20031123102012), we get a palindrome (41051255215014).
The spelling of 21020132113002 in words is "twenty-one trillion, twenty billion, one hundred thirty-two million, one hundred thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •