Base | Representation |
---|---|
bin | 1000110100110100000… |
… | …10101111010100111001 |
3 | 1001222200202201202000202 |
4 | 10122122002233110321 |
5 | 14432004410320441 |
6 | 351145232411545 |
7 | 30623242331150 |
oct | 4323202572471 |
9 | 1058622652022 |
10 | 303232120121 |
11 | 107666698a57 |
12 | 4a9279a6bb5 |
13 | 22796635418 |
14 | 109684cc597 |
15 | 7d4b30419b |
hex | 469a0af539 |
303232120121 has 16 divisors (see below), whose sum is σ = 353144707200. Its totient is φ = 254969490048.
The previous prime is 303232120117. The next prime is 303232120133. The reversal of 303232120121 is 121021232303.
It is not a de Polignac number, because 303232120121 - 22 = 303232120117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 303232120093 and 303232120102.
It is not an unprimeable number, because it can be changed into a prime (303232120141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2454725 + ... + 2575293.
It is an arithmetic number, because the mean of its divisors is an integer number (22071544200).
Almost surely, 2303232120121 is an apocalyptic number.
It is an amenable number.
303232120121 is a deficient number, since it is larger than the sum of its proper divisors (49912587079).
303232120121 is a wasteful number, since it uses less digits than its factorization.
303232120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127408.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 303232120121 its reverse (121021232303), we get a palindrome (424253352424).
The spelling of 303232120121 in words is "three hundred three billion, two hundred thirty-two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •