Base | Representation |
---|---|
bin | 10110111110000010100000… |
… | …111100011110011111101110 |
3 | 111020200110010120010021102020 |
4 | 112332002200330132133232 |
5 | 101220104114214310110 |
6 | 554504033245211010 |
7 | 30164322655501065 |
oct | 2676024074363756 |
9 | 436613116107366 |
10 | 101020331010030 |
11 | 2a2085332958a3 |
12 | b3b6500560a66 |
13 | 444a23a553b23 |
14 | 1ad35a54a71dc |
15 | ba2b85d88d70 |
hex | 5be0a0f1e7ee |
101020331010030 has 64 divisors (see below), whose sum is σ = 248128530439680. Its totient is φ = 26313489581184.
The previous prime is 101020331010007. The next prime is 101020331010161. The reversal of 101020331010030 is 30010133020101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 101020331009991 and 101020331010009.
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, 181485274 + ... + 182041053.
It is an arithmetic number, because the mean of its divisors is an integer number (3877008288120).
Almost surely, 2101020331010030 is an apocalyptic number.
101020331010030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101020331010030 is an abundant number, since it is smaller than the sum of its proper divisors (147108199429650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020331010030 is a wasteful number, since it uses less digits than its factorization.
101020331010030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363526553.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 101020331010030 its reverse (30010133020101), we get a palindrome (131030464030131).
The spelling of 101020331010030 in words is "one hundred one trillion, twenty billion, three hundred thirty-one million, ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •