Base | Representation |
---|---|
bin | 1001010100000010111… |
… | …11111110000000011101 |
3 | 1010120222100212112102221 |
4 | 10222001133332000131 |
5 | 20220330024034323 |
6 | 403001151145341 |
7 | 32055622000231 |
oct | 4520137760035 |
9 | 1116870775387 |
10 | 320000221213 |
11 | 113790867542 |
12 | 52027515251 |
13 | 2423958312a |
14 | 116b94845c1 |
15 | 84cd47055d |
hex | 4a817fe01d |
320000221213 has 8 divisors (see below), whose sum is σ = 322290239040. Its totient is φ = 317712451200.
The previous prime is 320000221201. The next prime is 320000221249. The reversal of 320000221213 is 312122000023.
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 320000221213 - 217 = 320000090141 is a prime.
It is a super-3 number, since 3×3200002212133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320000221313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 275695 + ... + 846172.
It is an arithmetic number, because the mean of its divisors is an integer number (40286279880).
Almost surely, 2320000221213 is an apocalyptic number.
It is an amenable number.
320000221213 is a deficient number, since it is larger than the sum of its proper divisors (2290017827).
320000221213 is a wasteful number, since it uses less digits than its factorization.
320000221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123907.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 320000221213 its reverse (312122000023), we get a palindrome (632122221236).
The spelling of 320000221213 in words is "three hundred twenty billion, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •