Base | Representation |
---|---|
bin | 101100010111000110100010… |
… | …0011000010001000110110111 |
3 | 1220011121001201101020101010001 |
4 | 1120232031010120101012313 |
5 | 402121042144040133421 |
6 | 3501520515101412131 |
7 | 145122152400403111 |
oct | 13056150430210667 |
9 | 1804531641211101 |
10 | 390203221021111 |
11 | 1033702907646a3 |
12 | 3791bbb926a047 |
13 | 1399600cb30364 |
14 | 6c4dd182d83b1 |
15 | 301a134311691 |
hex | 162e3446111b7 |
390203221021111 has 8 divisors (see below), whose sum is σ = 392041998432000. Its totient is φ = 388368765062520.
The previous prime is 390203221021109. The next prime is 390203221021189. The reversal of 390203221021111 is 111120122302093.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 390203221021111 - 21 = 390203221021109 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 390203221021111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390203221028111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1080182061 + ... + 1080543238.
It is an arithmetic number, because the mean of its divisors is an integer number (49005249804000).
Almost surely, 2390203221021111 is an apocalyptic number.
390203221021111 is a deficient number, since it is larger than the sum of its proper divisors (1838777410889).
390203221021111 is a wasteful number, since it uses less digits than its factorization.
390203221021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2160726149.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 390203221021111 in words is "three hundred ninety trillion, two hundred three billion, two hundred twenty-one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •