Base | Representation |
---|---|
bin | 10111001100100001000110… |
… | …111111011000010011100101 |
3 | 111101012120012110200202220001 |
4 | 113030201012333120103211 |
5 | 101332404220040444331 |
6 | 1000545054422541301 |
7 | 30326234046405610 |
oct | 2714410677302345 |
9 | 441176173622801 |
10 | 102015254234341 |
11 | 2a561476534aa8 |
12 | b5372a6297831 |
13 | 44bccc6abc186 |
14 | 1b297c9585177 |
15 | bbd9b6a80561 |
hex | 5cc846fd84e5 |
102015254234341 has 16 divisors (see below), whose sum is σ = 117453977872000. Its totient is φ = 86795173278720.
The previous prime is 102015254234303. The next prime is 102015254234401. The reversal of 102015254234341 is 143432452510201.
It is a cyclic number.
It is not a de Polignac number, because 102015254234341 - 29 = 102015254233829 is a prime.
It is a super-2 number, since 2×1020152542343412 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102015254234341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102015254234441) 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, 97969716 + ... + 99005533.
It is an arithmetic number, because the mean of its divisors is an integer number (7340873617000).
Almost surely, 2102015254234341 is an apocalyptic number.
It is an amenable number.
102015254234341 is a deficient number, since it is larger than the sum of its proper divisors (15438723637659).
102015254234341 is a wasteful number, since it uses less digits than its factorization.
102015254234341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196975804.
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 102015254234341 in words is "one hundred two trillion, fifteen billion, two hundred fifty-four million, two hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •