Base | Representation |
---|---|
bin | 10111001110001110110111… |
… | …111011010110110011100101 |
3 | 111101121211102020222121110012 |
4 | 113032032313323112303211 |
5 | 101341322103424401041 |
6 | 1001115145431540005 |
7 | 30340605516414212 |
oct | 2716166773266345 |
9 | 441554366877405 |
10 | 102133113122021 |
11 | 2a5a7456830803 |
12 | b5560b8b2a605 |
13 | 44cb15a522777 |
14 | 1b313aa3bcb09 |
15 | bc1ab3a9c3eb |
hex | 5ce3b7ed6ce5 |
102133113122021 has 8 divisors (see below), whose sum is σ = 104601642966144. Its totient is φ = 99676895148160.
The previous prime is 102133113121993. The next prime is 102133113122071. The reversal of 102133113122021 is 120221311331201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102133113122021 - 226 = 102133046013157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102133113122071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3077950775 + ... + 3077983956.
It is an arithmetic number, because the mean of its divisors is an integer number (13075205370768).
Almost surely, 2102133113122021 is an apocalyptic number.
It is an amenable number.
102133113122021 is a deficient number, since it is larger than the sum of its proper divisors (2468529844123).
102133113122021 is an equidigital number, since it uses as much as digits as its factorization.
102133113122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6155935131.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 102133113122021 its reverse (120221311331201), we get a palindrome (222354424453222).
The spelling of 102133113122021 in words is "one hundred two trillion, one hundred thirty-three billion, one hundred thirteen million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •