Base | Representation |
---|---|
bin | 1011010111100010001… |
… | …11010111000010110101 |
3 | 1101100012001022102222202 |
4 | 11223301013113002311 |
5 | 22344413111420333 |
6 | 455234032234245 |
7 | 40135145504630 |
oct | 5536107270265 |
9 | 1340161272882 |
10 | 390592295093 |
11 | 140716193470 |
12 | 6384869b985 |
13 | 2aaa957c750 |
14 | 14c9497cc17 |
15 | a260a355e8 |
hex | 5af11d70b5 |
390592295093 has 64 divisors (see below), whose sum is σ = 531673497600. Its totient is φ = 277074120960.
The previous prime is 390592295053. The next prime is 390592295131.
390592295093 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 390592295093 - 210 = 390592294069 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390592295053) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 86431088 + ... + 86435606.
It is an arithmetic number, because the mean of its divisors is an integer number (8307398400).
Almost surely, 2390592295093 is an apocalyptic number.
It is an amenable number.
390592295093 is a deficient number, since it is larger than the sum of its proper divisors (141081202507).
390592295093 is a wasteful number, since it uses less digits than its factorization.
390592295093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5722.
The product of its (nonzero) digits is 5904900, while the sum is 56.
The spelling of 390592295093 in words is "three hundred ninety billion, five hundred ninety-two million, two hundred ninety-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •