Base | Representation |
---|---|
bin | 10111111000100001100011… |
… | …010101011111110100111111 |
3 | 111202220200000110120220210222 |
4 | 113320201203111133310333 |
5 | 102231431131003131001 |
6 | 1011222232250251555 |
7 | 31060562632010006 |
oct | 2770414325376477 |
9 | 452820013526728 |
10 | 105039386770751 |
11 | 30517a54508544 |
12 | b945406126bbb |
13 | 467c230211504 |
14 | 1bd1d0d537c3d |
15 | c224aec4561b |
hex | 5f886355fd3f |
105039386770751 has 32 divisors (see below), whose sum is σ = 113288011603200. Its totient is φ = 97037061488640.
The previous prime is 105039386770727. The next prime is 105039386770753. The reversal of 105039386770751 is 157077683930501.
It is a cyclic number.
It is not a de Polignac number, because 105039386770751 - 26 = 105039386770687 is a prime.
It is a super-2 number, since 2×1050393867707512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105039386770753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163085435 + ... + 163728243.
It is an arithmetic number, because the mean of its divisors is an integer number (3540250362600).
Almost surely, 2105039386770751 is an apocalyptic number.
105039386770751 is a deficient number, since it is larger than the sum of its proper divisors (8248624832449).
105039386770751 is a wasteful number, since it uses less digits than its factorization.
105039386770751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643619.
The product of its (nonzero) digits is 33339600, while the sum is 62.
The spelling of 105039386770751 in words is "one hundred five trillion, thirty-nine billion, three hundred eighty-six million, seven hundred seventy thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •