Base | Representation |
---|---|
bin | 10111001101111100010101… |
… | …101011100011111010100001 |
3 | 111101112221001021000101022221 |
4 | 113031330111223203322201 |
5 | 101341010324032000413 |
6 | 1001102054524431041 |
7 | 30336302365041316 |
oct | 2715742553437241 |
9 | 441487037011287 |
10 | 102113211203233 |
11 | 2a599a7370263a |
12 | b5522839a8481 |
13 | 44c9308269169 |
14 | 1b3043d148d0d |
15 | bc12eb75768d |
hex | 5cdf15ae3ea1 |
102113211203233 has 16 divisors (see below), whose sum is σ = 106982817984000. Its totient is φ = 97348904346240.
The previous prime is 102113211203221. The next prime is 102113211203239. The reversal of 102113211203233 is 332302112311201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102113211203233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102113211203198 and 102113211203207.
It is not an unprimeable number, because it can be changed into a prime (102113211203239) 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, 55959388 + ... + 57755341.
It is an arithmetic number, because the mean of its divisors is an integer number (6686426124000).
Almost surely, 2102113211203233 is an apocalyptic number.
It is an amenable number.
102113211203233 is a deficient number, since it is larger than the sum of its proper divisors (4869606780767).
102113211203233 is a wasteful number, since it uses less digits than its factorization.
102113211203233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113715192.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 102113211203233 its reverse (332302112311201), we get a palindrome (434415323514434).
The spelling of 102113211203233 in words is "one hundred two trillion, one hundred thirteen billion, two hundred eleven million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •