Base | Representation |
---|---|
bin | 1011001011010110101… |
… | …00100001111000110101 |
3 | 1100201022021210012021211 |
4 | 11211223110201320311 |
5 | 22243014433230031 |
6 | 452233100441421 |
7 | 36514116343042 |
oct | 5455324417065 |
9 | 1321267705254 |
10 | 384052633141 |
11 | 13896a776671 |
12 | 62522549271 |
13 | 2a2a6752ba8 |
14 | 148342121c9 |
15 | 9ecb84cbb1 |
hex | 596b521e35 |
384052633141 has 8 divisors (see below), whose sum is σ = 393560762040. Its totient is φ = 374628276672.
The previous prime is 384052633109. The next prime is 384052633157. The reversal of 384052633141 is 141336250483.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 90407861041 + 293644772100 = 300679^2 + 541890^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 384052633141 - 25 = 384052633109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 384052633094 and 384052633103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (384052633841) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20933826 + ... + 20952163.
It is an arithmetic number, because the mean of its divisors is an integer number (49195095255).
Almost surely, 2384052633141 is an apocalyptic number.
It is an amenable number.
384052633141 is a deficient number, since it is larger than the sum of its proper divisors (9508128899).
384052633141 is a wasteful number, since it uses less digits than its factorization.
384052633141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41886215.
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 384052633141 in words is "three hundred eighty-four billion, fifty-two million, six hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •