Base | Representation |
---|---|
bin | 1011010110101110010… |
… | …01011011000111100101 |
3 | 1101022001200112021201021 |
4 | 11223113021123013211 |
5 | 22343020044102303 |
6 | 455122510331141 |
7 | 40121305423534 |
oct | 5532711330745 |
9 | 1338050467637 |
10 | 390156628453 |
11 | 140512277699 |
12 | 637467b9ab1 |
13 | 2aa3a230b37 |
14 | 14c52b7231b |
15 | a237678ebd |
hex | 5ad725b1e5 |
390156628453 has 4 divisors (see below), whose sum is σ = 413107018380. Its totient is φ = 367206238528.
The previous prime is 390156628427. The next prime is 390156628457. The reversal of 390156628453 is 354826651093.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 294005781729 + 96150846724 = 542223^2 + 310082^2 .
It is a cyclic number.
It is not a de Polignac number, because 390156628453 - 213 = 390156620261 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 390156628453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390156628457) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11475194938 + ... + 11475194971.
It is an arithmetic number, because the mean of its divisors is an integer number (103276754595).
Almost surely, 2390156628453 is an apocalyptic number.
It is an amenable number.
390156628453 is a deficient number, since it is larger than the sum of its proper divisors (22950389927).
390156628453 is a wasteful number, since it uses less digits than its factorization.
390156628453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22950389926.
The product of its (nonzero) digits is 4665600, while the sum is 52.
The spelling of 390156628453 in words is "three hundred ninety billion, one hundred fifty-six million, six hundred twenty-eight thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •