Base | Representation |
---|---|
bin | 1001010100010010011… |
… | …11000010010010011111 |
3 | 1010121022102001222111211 |
4 | 10222021033002102133 |
5 | 20221111240000111 |
6 | 403022104525251 |
7 | 32062056050152 |
oct | 4521117022237 |
9 | 1117272058454 |
10 | 320130000031 |
11 | 113848048266 |
12 | 52062a80827 |
13 | 2425a42202a |
14 | 116cc7c7c99 |
15 | 84d9a58521 |
hex | 4a893c249f |
320130000031 has 8 divisors (see below), whose sum is σ = 328895528544. Its totient is φ = 311370438240.
The previous prime is 320129999963. The next prime is 320130000053. The reversal of 320130000031 is 130000031023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-320130000031 is a prime.
It is a super-2 number, since 2×3201300000312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320129999966 and 320130000020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320130700031) 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, 1382800 + ... + 1597621.
It is an arithmetic number, because the mean of its divisors is an integer number (41111941068).
Almost surely, 2320130000031 is an apocalyptic number.
320130000031 is a deficient number, since it is larger than the sum of its proper divisors (8765528513).
320130000031 is a wasteful number, since it uses less digits than its factorization.
320130000031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2983361.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 320130000031 its reverse (130000031023), we get a palindrome (450130031054).
The spelling of 320130000031 in words is "three hundred twenty billion, one hundred thirty million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •