Base | Representation |
---|---|
bin | 10111001100011111001110… |
… | …011001101111000110101101 |
3 | 111101012100222110210220202212 |
4 | 113030133032121233012231 |
5 | 101332341044130202313 |
6 | 1000544121552100205 |
7 | 30326132652143000 |
oct | 2714371631570655 |
9 | 441170873726685 |
10 | 102013231100333 |
11 | 2a560628527523 |
12 | b536a20834665 |
13 | 44bca63905067 |
14 | 1b296769c7537 |
15 | bbd8e914d3a8 |
hex | 5cc7ce66f1ad |
102013231100333 has 16 divisors (see below), whose sum is σ = 121867473705600. Its totient is φ = 85307231570400.
The previous prime is 102013231100329. The next prime is 102013231100371. The reversal of 102013231100333 is 333001132310201.
It is not a de Polignac number, because 102013231100333 - 22 = 102013231100329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102013231100299 and 102013231100308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102013231100303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3626994083 + ... + 3627022208.
It is an arithmetic number, because the mean of its divisors is an integer number (7616717106600).
Almost surely, 2102013231100333 is an apocalyptic number.
It is an amenable number.
102013231100333 is a deficient number, since it is larger than the sum of its proper divisors (19854242605267).
102013231100333 is an frugal number, since it uses more digits than its factorization.
102013231100333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7254016353 (or 7254016339 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 102013231100333 its reverse (333001132310201), we get a palindrome (435014363410534).
The spelling of 102013231100333 in words is "one hundred two trillion, thirteen billion, two hundred thirty-one million, one hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •