Base | Representation |
---|---|
bin | 1001010100000011001… |
… | …00000101011001001001 |
3 | 1010120222102220100022112 |
4 | 10222001210011121021 |
5 | 20220330313100131 |
6 | 403001230232105 |
7 | 32055634112423 |
oct | 4520144053111 |
9 | 1116872810275 |
10 | 320001300041 |
11 | 113791434035 |
12 | 52027955635 |
13 | 242398701a7 |
14 | 116b9685813 |
15 | 84cd5d502b |
hex | 4a81905649 |
320001300041 has 4 divisors (see below), whose sum is σ = 320452642500. Its totient is φ = 319549957584.
The previous prime is 320001300001. The next prime is 320001300043. The reversal of 320001300041 is 140003100023.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 207175177225 + 112826122816 = 455165^2 + 335896^2 .
It is a cyclic number.
It is not a de Polignac number, because 320001300041 - 218 = 320001037897 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320001299989 and 320001300025.
It is not an unprimeable number, because it can be changed into a prime (320001300043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 225670166 + ... + 225671583.
It is an arithmetic number, because the mean of its divisors is an integer number (80113160625).
Almost surely, 2320001300041 is an apocalyptic number.
It is an amenable number.
320001300041 is a deficient number, since it is larger than the sum of its proper divisors (451342459).
320001300041 is an equidigital number, since it uses as much as digits as its factorization.
320001300041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451342458.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 320001300041 its reverse (140003100023), we get a palindrome (460004400064).
The spelling of 320001300041 in words is "three hundred twenty billion, one million, three hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •