Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …010111001100101001111100 |
3 | 111101012100102020011021211212 |
4 | 113030133001113030221330 |
5 | 101332340122124044012 |
6 | 1000544044135103552 |
7 | 30326124354503630 |
oct | 2714370127145174 |
9 | 441170366137755 |
10 | 102013012331132 |
11 | 2a560525a94a31 |
12 | b53697b511bb8 |
13 | 44bca2a4a8926 |
14 | 1b2965591adc0 |
15 | bbd8d4d37b22 |
hex | 5cc7c15cca7c |
102013012331132 has 96 divisors (see below), whose sum is σ = 207650214503424. Its totient is φ = 42948121536000.
The previous prime is 102013012331123. The next prime is 102013012331203. The reversal of 102013012331132 is 231133210310201.
It is a junction number, because it is equal to n+sod(n) for n = 102013012331098 and 102013012331107.
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, 3037802582 + ... + 3037836162.
It is an arithmetic number, because the mean of its divisors is an integer number (2163023067744).
Almost surely, 2102013012331132 is an apocalyptic number.
It is an amenable number.
102013012331132 is an abundant number, since it is smaller than the sum of its proper divisors (105637202172292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102013012331132 is a wasteful number, since it uses less digits than its factorization.
102013012331132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39579 (or 39577 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 102013012331132 its reverse (231133210310201), we get a palindrome (333146222641333).
The spelling of 102013012331132 in words is "one hundred two trillion, thirteen billion, twelve million, three hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •