Base | Representation |
---|---|
bin | 100100011001010100111001… |
… | …1001010011101111001110011 |
3 | 1112222112002211021210020122001 |
4 | 1020302221303022131321303 |
5 | 313430134114313324021 |
6 | 3052514213553554431 |
7 | 124301236464520624 |
oct | 11062516312357163 |
9 | 1488462737706561 |
10 | 320140204433011 |
11 | 930087754011a6 |
12 | 2baa5396875a17 |
13 | 10983126727801 |
14 | 590ac234d9a4b |
15 | 27028ac349091 |
hex | 1232a7329de73 |
320140204433011 has 16 divisors (see below), whose sum is σ = 326193870904704. Its totient is φ = 314131828921344.
The previous prime is 320140204433009. The next prime is 320140204433041. The reversal of 320140204433011 is 110334402041023.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 320140204433011 - 21 = 320140204433009 is a prime.
It is a super-2 number, since 2×3201402044330112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (320140204433041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 226847115 + ... + 228254011.
It is an arithmetic number, because the mean of its divisors is an integer number (20387116931544).
Almost surely, 2320140204433011 is an apocalyptic number.
320140204433011 is a deficient number, since it is larger than the sum of its proper divisors (6053666471693).
320140204433011 is a wasteful number, since it uses less digits than its factorization.
320140204433011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1422990.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 320140204433011 its reverse (110334402041023), we get a palindrome (430474606474034).
The spelling of 320140204433011 in words is "three hundred twenty trillion, one hundred forty billion, two hundred four million, four hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •