Base | Representation |
---|---|
bin | 1011001101100111100… |
… | …11000101101111001011 |
3 | 1100211110000211220112001 |
4 | 11212303303011233023 |
5 | 22303012230310401 |
6 | 452553455131431 |
7 | 36556213046125 |
oct | 5466363055713 |
9 | 1324400756461 |
10 | 385268603851 |
11 | 1394340a043a |
12 | 62801813b77 |
13 | 2a43b6497a1 |
14 | 1490b8dc215 |
15 | a04d490601 |
hex | 59b3cc5bcb |
385268603851 has 4 divisors (see below), whose sum is σ = 387420942600. Its totient is φ = 383116265104.
The previous prime is 385268603843. The next prime is 385268603861. The reversal of 385268603851 is 158306862583.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 385268603851 - 23 = 385268603843 is a prime.
It is a super-2 number, since 2×3852686038512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 385268603792 and 385268603801.
It is not an unprimeable number, because it can be changed into a prime (385268603831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1076169106 + ... + 1076169463.
It is an arithmetic number, because the mean of its divisors is an integer number (96855235650).
Almost surely, 2385268603851 is an apocalyptic number.
385268603851 is a deficient number, since it is larger than the sum of its proper divisors (2152338749).
385268603851 is a wasteful number, since it uses less digits than its factorization.
385268603851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2152338748.
The product of its (nonzero) digits is 8294400, while the sum is 55.
The spelling of 385268603851 in words is "three hundred eighty-five billion, two hundred sixty-eight million, six hundred three thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •