Base | Representation |
---|---|
bin | 10111001100100001000110… |
… | …111111011000000000101011 |
3 | 111101012120012110200201020020 |
4 | 113030201012333120000223 |
5 | 101332404220040430011 |
6 | 1000545054422531523 |
7 | 30326234046402231 |
oct | 2714410677300053 |
9 | 441176173621206 |
10 | 102015254233131 |
11 | 2a5614765340a8 |
12 | b5372a6296ba3 |
13 | 44bccc6abb765 |
14 | 1b297c9584951 |
15 | bbd9b6a80006 |
hex | 5cc846fd802b |
102015254233131 has 8 divisors (see below), whose sum is σ = 136886710563984. Its totient is φ = 67576983695520.
The previous prime is 102015254233043. The next prime is 102015254233187. The reversal of 102015254233131 is 131332452510201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102015254233131 - 222 = 102015250038827 is a prime.
It is a super-2 number, since 2×1020152542331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102015254233092 and 102015254233101.
It is not an unprimeable number, because it can be changed into a prime (102015254233031) 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, 108296447760 + ... + 108296448701.
It is an arithmetic number, because the mean of its divisors is an integer number (17110838820498).
Almost surely, 2102015254233131 is an apocalyptic number.
102015254233131 is a deficient number, since it is larger than the sum of its proper divisors (34871456330853).
102015254233131 is a wasteful number, since it uses less digits than its factorization.
102015254233131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216592896621.
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 102015254233131 in words is "one hundred two trillion, fifteen billion, two hundred fifty-four million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •