Base | Representation |
---|---|
bin | 10111001111001110011010… |
… | …000101110011011100011100 |
3 | 111101212100111112212202002001 |
4 | 113033032122011303130130 |
5 | 101343431311444133040 |
6 | 1001210351015412044 |
7 | 30345542165451451 |
oct | 2717163205633434 |
9 | 441770445782061 |
10 | 102201332021020 |
11 | 2a6233835a7281 |
12 | b567377384024 |
13 | 450470c9662ab |
14 | 1b347dc63b828 |
15 | bc3757b3959a |
hex | 5cf39a17371c |
102201332021020 has 48 divisors (see below), whose sum is σ = 227252966629248. Its totient is φ = 38474898406400.
The previous prime is 102201332020943. The next prime is 102201332021069. The reversal of 102201332021020 is 20120233102201.
It is a super-2 number, since 2×1022013320210202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11188314 + ... + 18154366.
It is an arithmetic number, because the mean of its divisors is an integer number (4734436804776).
Almost surely, 2102201332021020 is an apocalyptic number.
102201332021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102201332021020 is an abundant number, since it is smaller than the sum of its proper divisors (125051634608228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102201332021020 is a wasteful number, since it uses less digits than its factorization.
102201332021020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7009230 (or 7009228 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102201332021020 its reverse (20120233102201), we get a palindrome (122321565123221).
The spelling of 102201332021020 in words is "one hundred two trillion, two hundred one billion, three hundred thirty-two million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •