Base | Representation |
---|---|
bin | 10111001110001110000001… |
… | …101100010111000000011101 |
3 | 111101121202001211211211221011 |
4 | 113032032001230113000131 |
5 | 101341313223011033041 |
6 | 1001114515245335221 |
7 | 30340544130400501 |
oct | 2716160154270035 |
9 | 441552054754834 |
10 | 102132203221021 |
11 | 2a5a702a156706 |
12 | b555aa4267511 |
13 | 44cb043b705cc |
14 | 1b31321606301 |
15 | bc1a5dc66e81 |
hex | 5ce381b1701d |
102132203221021 has 16 divisors (see below), whose sum is σ = 107450793648000. Its totient is φ = 96888774313408.
The previous prime is 102132203221019. The next prime is 102132203221057. The reversal of 102132203221021 is 120122302231201.
It is a cyclic number.
It is not a de Polignac number, because 102132203221021 - 21 = 102132203221019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102132203220983 and 102132203221001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102132203221091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20353306 + ... + 24870091.
It is an arithmetic number, because the mean of its divisors is an integer number (6715674603000).
Almost surely, 2102132203221021 is an apocalyptic number.
It is an amenable number.
102132203221021 is a deficient number, since it is larger than the sum of its proper divisors (5318590426979).
102132203221021 is a wasteful number, since it uses less digits than its factorization.
102132203221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45224228.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 102132203221021 its reverse (120122302231201), we get a palindrome (222254505452222).
The spelling of 102132203221021 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred three million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •