Base | Representation |
---|---|
bin | 1011010111000010000… |
… | …11111110111110010101 |
3 | 1101022111021112112202011 |
4 | 11223201003332332111 |
5 | 22343340140141423 |
6 | 455151211544221 |
7 | 40125365354005 |
oct | 5534103767625 |
9 | 1338437475664 |
10 | 390322974613 |
11 | 140598163a60 |
12 | 6379245b071 |
13 | 2aa65834010 |
14 | 14c6acb4005 |
15 | a247086b0d |
hex | 5ae10fef95 |
390322974613 has 32 divisors (see below), whose sum is σ = 471297576960. Its totient is φ = 318570183360.
The previous prime is 390322974581. The next prime is 390322974641. The reversal of 390322974613 is 316479223093.
It is not a de Polignac number, because 390322974613 - 25 = 390322974581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390322974913) 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, 499056 + ... + 1014742.
It is an arithmetic number, because the mean of its divisors is an integer number (14728049280).
Almost surely, 2390322974613 is an apocalyptic number.
It is an amenable number.
390322974613 is a deficient number, since it is larger than the sum of its proper divisors (80974602347).
390322974613 is a wasteful number, since it uses less digits than its factorization.
390322974613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 515857.
The product of its (nonzero) digits is 1469664, while the sum is 49.
The spelling of 390322974613 in words is "three hundred ninety billion, three hundred twenty-two million, nine hundred seventy-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •