Base | Representation |
---|---|
bin | 10111001101001100000010… |
… | …000101000011110101100011 |
3 | 111101100222011110100020010102 |
4 | 113031030002011003311203 |
5 | 101334133112220020330 |
6 | 1001022200015253015 |
7 | 30332455134246356 |
oct | 2715140205036543 |
9 | 441328143306112 |
10 | 102061342735715 |
11 | 2a579a77271260 |
12 | b54420921a16b |
13 | 44c446038626c |
14 | 1b2bb1c5dc29d |
15 | bbecb2d32945 |
hex | 5cd302143d63 |
102061342735715 has 32 divisors (see below), whose sum is σ = 136717146086400. Its totient is φ = 72498953157120.
The previous prime is 102061342735687. The next prime is 102061342735717. The reversal of 102061342735715 is 517537243160201.
It is not a de Polignac number, because 102061342735715 - 222 = 102061338541411 is a prime.
It is a super-2 number, since 2×1020613427357152 (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 102061342735715.
It is not an unprimeable number, because it can be changed into a prime (102061342735717) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 145141691 + ... + 145843179.
It is an arithmetic number, because the mean of its divisors is an integer number (4272410815200).
Almost surely, 2102061342735715 is an apocalyptic number.
102061342735715 is a deficient number, since it is larger than the sum of its proper divisors (34655803350685).
102061342735715 is a wasteful number, since it uses less digits than its factorization.
102061342735715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763067.
The product of its (nonzero) digits is 1058400, while the sum is 47.
Adding to 102061342735715 its reverse (517537243160201), we get a palindrome (619598585895916).
The spelling of 102061342735715 in words is "one hundred two trillion, sixty-one billion, three hundred forty-two million, seven hundred thirty-five thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •