Base | Representation |
---|---|
bin | 1000110100100100110… |
… | …10011101100100011001 |
3 | 1001222100211212201101202 |
4 | 10122102122131210121 |
5 | 14431224123333423 |
6 | 351124421123545 |
7 | 30620126343203 |
oct | 4322232354431 |
9 | 1058324781352 |
10 | 303104121113 |
11 | 107600413452 |
12 | 4a8b0b595b5 |
13 | 22775c6a671 |
14 | 109554cd773 |
15 | 7d3ee6d728 |
hex | 469269d919 |
303104121113 has 4 divisors (see below), whose sum is σ = 304627257600. Its totient is φ = 301580984628.
The previous prime is 303104121059. The next prime is 303104121149. The reversal of 303104121113 is 311121401303.
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: 311121401303 = 118861 ⋅2617523.
It is a cyclic number.
It is not a de Polignac number, because 303104121113 - 28 = 303104120857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (303104121013) 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, 761567945 + ... + 761568342.
It is an arithmetic number, because the mean of its divisors is an integer number (76156814400).
Almost surely, 2303104121113 is an apocalyptic number.
It is an amenable number.
303104121113 is a deficient number, since it is larger than the sum of its proper divisors (1523136487).
303104121113 is a wasteful number, since it uses less digits than its factorization.
303104121113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1523136486.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 303104121113 its reverse (311121401303), we get a palindrome (614225522416).
The spelling of 303104121113 in words is "three hundred three billion, one hundred four million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •