Base | Representation |
---|---|
bin | 1000110100110011110… |
… | …10101010000010101001 |
3 | 1001222200121202002120200 |
4 | 10122121322222002221 |
5 | 14432003340020241 |
6 | 351145115142413 |
7 | 30623215324662 |
oct | 4323172520251 |
9 | 1058617662520 |
10 | 303230001321 |
11 | 107665481085 |
12 | 4a927144a09 |
13 | 22796072bb0 |
14 | 109680da369 |
15 | 7d4b0364b6 |
hex | 4699eaa0a9 |
303230001321 has 24 divisors (see below), whose sum is σ = 473926654656. Its totient is φ = 185718687840.
The previous prime is 303230001271. The next prime is 303230001359. The reversal of 303230001321 is 123100032303.
303230001321 is a `hidden beast` number, since 303 + 230 + 0 + 0 + 132 + 1 = 666.
It is not a de Polignac number, because 303230001321 - 29 = 303230000809 is a prime.
It is a super-2 number, since 2×3032300013212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 303230001294 and 303230001303.
It is not an unprimeable number, because it can be changed into a prime (303230001121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6116805 + ... + 6166178.
It is an arithmetic number, because the mean of its divisors is an integer number (19746943944).
Almost surely, 2303230001321 is an apocalyptic number.
It is an amenable number.
303230001321 is a deficient number, since it is larger than the sum of its proper divisors (170696653335).
303230001321 is a wasteful number, since it uses less digits than its factorization.
303230001321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12283213 (or 12283210 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 303230001321 its reverse (123100032303), we get a palindrome (426330033624).
The spelling of 303230001321 in words is "three hundred three billion, two hundred thirty million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •