Base | Representation |
---|---|
bin | 10111001100101110111100… |
… | …100001100100011100101100 |
3 | 111101020222112212101100110010 |
4 | 113030232330201210130230 |
5 | 101333130131411030012 |
6 | 1000555552543413220 |
7 | 30330301160203032 |
oct | 2714567441443454 |
9 | 441228485340403 |
10 | 102030111033132 |
11 | 2a5677aa838907 |
12 | b53a1518b4210 |
13 | 44c1523a79a89 |
14 | 1b2a3d8770552 |
15 | bbe086009c3c |
hex | 5ccbbc86472c |
102030111033132 has 12 divisors (see below), whose sum is σ = 238070259077336. Its totient is φ = 34010037011040.
The previous prime is 102030111033091. The next prime is 102030111033209. The reversal of 102030111033132 is 231330111030201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 102030111033099 and 102030111033108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4251254626369 + ... + 4251254626392.
Almost surely, 2102030111033132 is an apocalyptic number.
102030111033132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102030111033132 is an abundant number, since it is smaller than the sum of its proper divisors (136040148044204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102030111033132 is a wasteful number, since it uses less digits than its factorization.
102030111033132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8502509252768 (or 8502509252766 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 102030111033132 its reverse (231330111030201), we get a palindrome (333360222063333).
The spelling of 102030111033132 in words is "one hundred two trillion, thirty billion, one hundred eleven million, thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •