Base | Representation |
---|---|
bin | 1000110001010001011… |
… | …10111011000101100001 |
3 | 1001210210021121220200011 |
4 | 10120220232323011201 |
5 | 14414111230200001 |
6 | 350232443124521 |
7 | 30525160042351 |
oct | 4305056730541 |
9 | 1053707556604 |
10 | 301331100001 |
11 | 106880606448 |
12 | 4a497213741 |
13 | 22552835449 |
14 | 10827c3ab61 |
15 | 7c89493d51 |
hex | 4628bbb161 |
301331100001 has 4 divisors (see below), whose sum is σ = 317190631600. Its totient is φ = 285471568404.
The previous prime is 301331099987. The next prime is 301331100011. The reversal of 301331100001 is 100001133103.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 100001133103 = 107 ⋅934590029.
It is a cyclic number.
It is not a de Polignac number, because 301331100001 - 25 = 301331099969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (301331100011) 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, 7929765771 + ... + 7929765808.
It is an arithmetic number, because the mean of its divisors is an integer number (79297657900).
Almost surely, 2301331100001 is an apocalyptic number.
It is an amenable number.
301331100001 is a deficient number, since it is larger than the sum of its proper divisors (15859531599).
301331100001 is a wasteful number, since it uses less digits than its factorization.
301331100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15859531598.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 301331100001 its reverse (100001133103), we get a palindrome (401332233104).
The spelling of 301331100001 in words is "three hundred one billion, three hundred thirty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •