Base | Representation |
---|---|
bin | 1011010111011110111… |
… | …11101010010100001100 |
3 | 1101100010011011100111102 |
4 | 11223233133222110030 |
5 | 22344334132023202 |
6 | 455231221442232 |
7 | 40134365445104 |
oct | 5535737522414 |
9 | 1340104140442 |
10 | 390565111052 |
11 | 140701906716 |
12 | 6383b570378 |
13 | 2aaa3a5240c |
14 | 14c91104204 |
15 | a25d465d02 |
hex | 5aef7ea50c |
390565111052 has 6 divisors (see below), whose sum is σ = 683488944348. Its totient is φ = 195282555524.
The previous prime is 390565111039. The next prime is 390565111091. The reversal of 390565111052 is 250111565093.
It is a happy number.
It is a super-2 number, since 2×3905651110522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 390565110997 and 390565111015.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 48820638878 + ... + 48820638885.
It is an arithmetic number, because the mean of its divisors is an integer number (113914824058).
Almost surely, 2390565111052 is an apocalyptic number.
It is an amenable number.
390565111052 is a deficient number, since it is larger than the sum of its proper divisors (292923833296).
390565111052 is a wasteful number, since it uses less digits than its factorization.
390565111052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97641277767 (or 97641277765 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 38.
The spelling of 390565111052 in words is "three hundred ninety billion, five hundred sixty-five million, one hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •