Base | Representation |
---|---|
bin | 1001010100000011000… |
… | …10111111000110010001 |
3 | 1010120222102100201100112 |
4 | 10222001202333012101 |
5 | 20220330224341423 |
6 | 403001220131105 |
7 | 32055631503116 |
oct | 4520142770621 |
9 | 1116872321315 |
10 | 320001012113 |
11 | 113791257782 |
12 | 52027836a95 |
13 | 2423979c113 |
14 | 116b960c90d |
15 | 84cd579a78 |
hex | 4a818bf191 |
320001012113 has 8 divisors (see below), whose sum is σ = 321651432000. Its totient is φ = 318351016368.
The previous prime is 320001012101. The next prime is 320001012161. The reversal of 320001012113 is 311210100023.
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 320001012113 - 28 = 320001011857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (320001012613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1466723 + ... + 1670711.
It is an arithmetic number, because the mean of its divisors is an integer number (40206429000).
Almost surely, 2320001012113 is an apocalyptic number.
It is an amenable number.
320001012113 is a deficient number, since it is larger than the sum of its proper divisors (1650419887).
320001012113 is a wasteful number, since it uses less digits than its factorization.
320001012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212071.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 320001012113 its reverse (311210100023), we get a palindrome (631211112136).
It can be divided in two parts, 3200010 and 12113, that added together give a palindrome (3212123).
The spelling of 320001012113 in words is "three hundred twenty billion, one million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •