Base | Representation |
---|---|
bin | 1000110101001000001… |
… | …11010111001100100001 |
3 | 1002000010112201000112220 |
4 | 10122210013113030201 |
5 | 14432331140313121 |
6 | 351214110341253 |
7 | 30630363556041 |
oct | 4324407271441 |
9 | 1060115630486 |
10 | 303401104161 |
11 | 107743017191 |
12 | 4a9744ba829 |
13 | 227c265018c |
14 | 10982b19721 |
15 | 7d5b0836c6 |
hex | 46a41d7321 |
303401104161 has 8 divisors (see below), whose sum is σ = 404668813920. Its totient is φ = 202200398592.
The previous prime is 303401104159. The next prime is 303401104199. The reversal of 303401104161 is 161401104303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 303401104161 - 21 = 303401104159 is a prime.
It is a super-2 number, since 2×3034011041612 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (303401104151) 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, 16740480 + ... + 16758593.
It is an arithmetic number, because the mean of its divisors is an integer number (50583601740).
Almost surely, 2303401104161 is an apocalyptic number.
It is an amenable number.
303401104161 is a deficient number, since it is larger than the sum of its proper divisors (101267709759).
303401104161 is a wasteful number, since it uses less digits than its factorization.
303401104161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33502095.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 303401104161 its reverse (161401104303), we get a palindrome (464802208464).
The spelling of 303401104161 in words is "three hundred three billion, four hundred one million, one hundred four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •