Base | Representation |
---|---|
bin | 10110111100101… |
… | …100110110111011 |
3 | 222211110120222112 |
4 | 112330230312323 |
5 | 1242030324011 |
6 | 102112042535 |
7 | 12353353301 |
oct | 2674546673 |
9 | 884416875 |
10 | 385011131 |
11 | 18836861a |
12 | a8b3344b |
13 | 619c404b |
14 | 391c2271 |
15 | 23c0258b |
hex | 16f2cdbb |
385011131 has 4 divisors (see below), whose sum is σ = 385054152. Its totient is φ = 384968112.
The previous prime is 385011113. The next prime is 385011229. The reversal of 385011131 is 131110583.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 385011131 - 210 = 385010107 is a prime.
It is a super-2 number, since 2×3850111312 = 296467141987798322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 385011097 and 385011106.
It is not an unprimeable number, because it can be changed into a prime (385001131) 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, 2465 + ... + 27858.
It is an arithmetic number, because the mean of its divisors is an integer number (96263538).
Almost surely, 2385011131 is an apocalyptic number.
385011131 is a deficient number, since it is larger than the sum of its proper divisors (43021).
385011131 is a wasteful number, since it uses less digits than its factorization.
385011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43020.
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 385011131 is about 19621.7005124428. The cubic root of 385011131 is about 727.4856456901.
The spelling of 385011131 in words is "three hundred eighty-five million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •