Base | Representation |
---|---|
bin | 10001100111101011000110… |
… | …11011100001011111000001 |
3 | 12002012010122221202000012212 |
4 | 20303311203123201133001 |
5 | 20034310432420333031 |
6 | 214223532213231505 |
7 | 11106230036021261 |
oct | 1063654333413701 |
9 | 162163587660185 |
10 | 38746568136641 |
11 | 11389366657222 |
12 | 4419417332595 |
13 | 1880a2a23c081 |
14 | 97d4b595b7a1 |
15 | 472d4923d12b |
hex | 233d636e17c1 |
38746568136641 has 4 divisors (see below), whose sum is σ = 38748127316784. Its totient is φ = 38745008956500.
The previous prime is 38746568136629. The next prime is 38746568136709. The reversal of 38746568136641 is 14663186564783.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 38746568136641 - 214 = 38746568120257 is a prime.
It is a super-2 number, since 2×387465681366412 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (38746568132641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 779552795 + ... + 779602496.
It is an arithmetic number, because the mean of its divisors is an integer number (9687031829196).
Almost surely, 238746568136641 is an apocalyptic number.
It is an amenable number.
38746568136641 is a deficient number, since it is larger than the sum of its proper divisors (1559180143).
38746568136641 is a wasteful number, since it uses less digits than its factorization.
38746568136641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1559180142.
The product of its digits is 418037760, while the sum is 68.
The spelling of 38746568136641 in words is "thirty-eight trillion, seven hundred forty-six billion, five hundred sixty-eight million, one hundred thirty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •