Base | Representation |
---|---|
bin | 10111001111101010111111… |
… | …110101110001000000011100 |
3 | 111101222021201221202211222110 |
4 | 113033222333311301000130 |
5 | 101344432144202401022 |
6 | 1001232425110314020 |
7 | 30351010003142250 |
oct | 2717527765610034 |
9 | 441867657684873 |
10 | 102232030122012 |
11 | 2a6353a690297a |
12 | b571304058910 |
13 | 45075928542ab |
14 | 1b360b1688260 |
15 | bc4452bad00c |
hex | 5cfabfd7101c |
102232030122012 has 96 divisors (see below), whose sum is σ = 273492295498240. Its totient is φ = 29115665187840.
The previous prime is 102232030121999. The next prime is 102232030122031. The reversal of 102232030122012 is 210221030232201.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 102232030122012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44257983 + ... + 46510569.
Almost surely, 2102232030122012 is an apocalyptic number.
102232030122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102232030122012 is an abundant number, since it is smaller than the sum of its proper divisors (171260265376228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102232030122012 is a wasteful number, since it uses less digits than its factorization.
102232030122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2254331 (or 2254329 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 102232030122012 its reverse (210221030232201), we get a palindrome (312453060354213).
The spelling of 102232030122012 in words is "one hundred two trillion, two hundred thirty-two billion, thirty million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •