Base | Representation |
---|---|
bin | 10111001110010101100101… |
… | …101111111011111000000100 |
3 | 111101122112000211010222111200 |
4 | 113032111211233323320010 |
5 | 101341431341012043022 |
6 | 1001122341153102500 |
7 | 30341252311604142 |
oct | 2716254557737004 |
9 | 441575024128450 |
10 | 102140324331012 |
11 | 2a5aa517323860 |
12 | b55758bb57a30 |
13 | 44cba39508936 |
14 | 1b31891dd8592 |
15 | bc1d86bd6bac |
hex | 5ce565bfbe04 |
102140324331012 has 36 divisors (see below), whose sum is σ = 281659682247216. Its totient is φ = 30951613433520.
The previous prime is 102140324330929. The next prime is 102140324331061. The reversal of 102140324331012 is 210133423041201.
102140324331012 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 4 + 0 + 324 + 331 + 0 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
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, 128965055578 + ... + 128965056369.
Almost surely, 2102140324331012 is an apocalyptic number.
102140324331012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102140324331012 is an abundant number, since it is smaller than the sum of its proper divisors (179519357916204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102140324331012 is a wasteful number, since it uses less digits than its factorization.
102140324331012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257930111968 (or 257930111963 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 102140324331012 its reverse (210133423041201), we get a palindrome (312273747372213).
The spelling of 102140324331012 in words is "one hundred two trillion, one hundred forty billion, three hundred twenty-four million, three hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •