Base | Representation |
---|---|
bin | 1011001101110011100… |
… | …11110100110100100111 |
3 | 1100211201001121221011020 |
4 | 11212321303310310213 |
5 | 22303214040210012 |
6 | 453011500542223 |
7 | 36561546235320 |
oct | 5467163646447 |
9 | 1324631557136 |
10 | 385369460007 |
11 | 139486017134 |
12 | 6282b551973 |
13 | 2a4564ccb9c |
14 | 1491b073447 |
15 | a057263a8c |
hex | 59b9cf4d27 |
385369460007 has 32 divisors (see below), whose sum is σ = 609318377472. Its totient is φ = 212050566144.
The previous prime is 385369459967. The next prime is 385369460029. The reversal of 385369460007 is 700064963583.
It is not a de Polignac number, because 385369460007 - 28 = 385369459751 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (385369465007) 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 31 ways as a sum of consecutive naturals, for example, 2481183 + ... + 2631920.
It is an arithmetic number, because the mean of its divisors is an integer number (19041199296).
Almost surely, 2385369460007 is an apocalyptic number.
385369460007 is a gapful number since it is divisible by the number (37) formed by its first and last digit.
385369460007 is a deficient number, since it is larger than the sum of its proper divisors (223948917465).
385369460007 is a wasteful number, since it uses less digits than its factorization.
385369460007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5113247.
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 385369460007 in words is "three hundred eighty-five billion, three hundred sixty-nine million, four hundred sixty thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •