Base | Representation |
---|---|
bin | 10111001110010101100110… |
… | …000110010101000000101101 |
3 | 111101122112001020012012210120 |
4 | 113032111212012111000231 |
5 | 101341431344012414013 |
6 | 1001122341522555153 |
7 | 30341252412523200 |
oct | 2716254606250055 |
9 | 441575036165716 |
10 | 102140330201133 |
11 | 2a5aa51a6730a4 |
12 | b557591b08ab9 |
13 | 44cba3a7b2793 |
14 | 1b31892ac5937 |
15 | bc1d87496123 |
hex | 5ce56619502d |
102140330201133 has 48 divisors (see below), whose sum is σ = 158849950187520. Its totient is φ = 58208168126304.
The previous prime is 102140330201111. The next prime is 102140330201141. The reversal of 102140330201133 is 331102033041201.
It is not a de Polignac number, because 102140330201133 - 29 = 102140330200621 is a prime.
It is a super-3 number, since 3×1021403302011333 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102140330211133) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 659714016 + ... + 659868822.
It is an arithmetic number, because the mean of its divisors is an integer number (3309373962240).
Almost surely, 2102140330201133 is an apocalyptic number.
It is an amenable number.
102140330201133 is a deficient number, since it is larger than the sum of its proper divisors (56709619986387).
102140330201133 is a wasteful number, since it uses less digits than its factorization.
102140330201133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166926 (or 166919 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 102140330201133 its reverse (331102033041201), we get a palindrome (433242363242334).
The spelling of 102140330201133 in words is "one hundred two trillion, one hundred forty billion, three hundred thirty million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •