Base | Representation |
---|---|
bin | 100100000110111000… |
… | …101111000111011101 |
3 | 10201001222001100200101 |
4 | 210012320233013131 |
5 | 1113400140221023 |
6 | 25451044501101 |
7 | 2541522422356 |
oct | 440670570735 |
9 | 121058040611 |
10 | 38770242013 |
11 | 15495877728 |
12 | 76200aa791 |
13 | 386b36c309 |
14 | 1c3b132d2d |
15 | 101da6e1ad |
hex | 906e2f1dd |
38770242013 has 4 divisors (see below), whose sum is σ = 40107146940. Its totient is φ = 37433337088.
The previous prime is 38770242011. The next prime is 38770242029. The reversal of 38770242013 is 31024207783.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 32698403929 + 6071838084 = 180827^2 + 77922^2 .
It is a cyclic number.
It is not a de Polignac number, because 38770242013 - 21 = 38770242011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38770242011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 668452420 + ... + 668452477.
It is an arithmetic number, because the mean of its divisors is an integer number (10026786735).
Almost surely, 238770242013 is an apocalyptic number.
It is an amenable number.
38770242013 is a deficient number, since it is larger than the sum of its proper divisors (1336904927).
38770242013 is a wasteful number, since it uses less digits than its factorization.
38770242013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1336904926.
The product of its (nonzero) digits is 56448, while the sum is 37.
Adding to 38770242013 its reverse (31024207783), we get a palindrome (69794449796).
The spelling of 38770242013 in words is "thirty-eight billion, seven hundred seventy million, two hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •