Base | Representation |
---|---|
bin | 10011001100001110… |
… | …00001000111110111 |
3 | 222121001000011220000 |
4 | 21212013001013313 |
5 | 132100040101411 |
6 | 4422210042343 |
7 | 513214324215 |
oct | 114607010767 |
9 | 28531004800 |
10 | 10303050231 |
11 | 4407892151 |
12 | 1bb65793b3 |
13 | c82715736 |
14 | 6da4cbcb5 |
15 | 4047c0956 |
hex | 2661c11f7 |
10303050231 has 10 divisors (see below), whose sum is σ = 15390976392. Its totient is φ = 6868700100.
The previous prime is 10303050227. The next prime is 10303050239. The reversal of 10303050231 is 13205030301.
10303050231 is a `hidden beast` number, since 103 + 0 + 30 + 502 + 31 = 666.
10303050231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10303050231 - 22 = 10303050227 is a prime.
It is a super-2 number, since 2×103030502312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303050239) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 63598995 + ... + 63599156.
Almost surely, 210303050231 is an apocalyptic number.
10303050231 is a deficient number, since it is larger than the sum of its proper divisors (5087926161).
10303050231 is an equidigital number, since it uses as much as digits as its factorization.
10303050231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127198163 (or 127198154 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
Adding to 10303050231 its reverse (13205030301), we get a palindrome (23508080532).
The spelling of 10303050231 in words is "ten billion, three hundred three million, fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •