Base | Representation |
---|---|
bin | 1000110100110010110… |
… | …00011001011001000110 |
3 | 1001222122222211210211200 |
4 | 10122121120121121012 |
5 | 14431444040121410 |
6 | 351144154443330 |
7 | 30623046101022 |
oct | 4323130313106 |
9 | 1058588753750 |
10 | 303221020230 |
11 | 1076603a7497 |
12 | 4a924133546 |
13 | 2279424a03b |
14 | 10966c3d382 |
15 | 7d4a3603c0 |
hex | 4699619646 |
303221020230 has 48 divisors (see below), whose sum is σ = 788533905744. Its totient is φ = 80842605120.
The previous prime is 303221020181. The next prime is 303221020241. The reversal of 303221020230 is 32020122303.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 111040 + ... + 786620.
It is an arithmetic number, because the mean of its divisors is an integer number (16427789703).
Almost surely, 2303221020230 is an apocalyptic number.
303221020230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
303221020230 is an abundant number, since it is smaller than the sum of its proper divisors (485312885514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
303221020230 is a wasteful number, since it uses less digits than its factorization.
303221020230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680581 (or 680578 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 303221020230 its reverse (32020122303), we get a palindrome (335241142533).
The spelling of 303221020230 in words is "three hundred three billion, two hundred twenty-one million, twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •