Base | Representation |
---|---|
bin | 10110111111100… |
… | …100100010000000 |
3 | 222212212210222102 |
4 | 112333210202000 |
5 | 1242223412311 |
6 | 102140125532 |
7 | 12362635541 |
oct | 2677444200 |
9 | 885783872 |
10 | 385763456 |
11 | 188831881 |
12 | a92368a8 |
13 | 61bc8600 |
14 | 3933a4c8 |
15 | 23d0043b |
hex | 16fe4880 |
385763456 has 96 divisors (see below), whose sum is σ = 881968500. Its totient is φ = 167411712.
The previous prime is 385763431. The next prime is 385763489. The reversal of 385763456 is 654367583.
It can be written as a sum of positive squares in 6 ways, for example, as 190881856 + 194881600 = 13816^2 + 13960^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 385763456.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 367220 + ... + 368268.
Almost surely, 2385763456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 385763456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (440984250).
385763456 is an abundant number, since it is smaller than the sum of its proper divisors (496205044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
385763456 is a wasteful number, since it uses less digits than its factorization.
385763456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106 (or 1081 counting only the distinct ones).
The product of its digits is 1814400, while the sum is 47.
The square root of 385763456 is about 19640.8618955483. The cubic root of 385763456 is about 727.9591813848.
The spelling of 385763456 in words is "three hundred eighty-five million, seven hundred sixty-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •