Base | Representation |
---|---|
bin | 1000110100110100001… |
… | …10001101011111101001 |
3 | 1001222200211102222022110 |
4 | 10122122012031133221 |
5 | 14432010123430441 |
6 | 351145304112533 |
7 | 30623253141210 |
oct | 4323206153751 |
9 | 1058624388273 |
10 | 303233030121 |
11 | 10766715a71a |
12 | 4a928165749 |
13 | 22796893698 |
14 | 10968688077 |
15 | 7d4b433b16 |
hex | 469a18d7e9 |
303233030121 has 8 divisors (see below), whose sum is σ = 462069379264. Its totient is φ = 173276017200.
The previous prime is 303233030099. The next prime is 303233030189. The reversal of 303233030121 is 121030332303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 303233030121 - 27 = 303233029993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 14439668101 = 303233030121 / (3 + 0 + 3 + 2 + 3 + 3 + 0 + 3 + 0 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (303233030621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7219834030 + ... + 7219834071.
It is an arithmetic number, because the mean of its divisors is an integer number (57758672408).
Almost surely, 2303233030121 is an apocalyptic number.
It is an amenable number.
303233030121 is a deficient number, since it is larger than the sum of its proper divisors (158836349143).
303233030121 is a wasteful number, since it uses less digits than its factorization.
303233030121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14439668111.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 303233030121 its reverse (121030332303), we get a palindrome (424263362424).
The spelling of 303233030121 in words is "three hundred three billion, two hundred thirty-three million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •