Base | Representation |
---|---|
bin | 10011001111100101… |
… | …00011110001001111 |
3 | 222200000001110002222 |
4 | 21213302203301033 |
5 | 132124244212201 |
6 | 4425054205555 |
7 | 514006050521 |
oct | 114762436117 |
9 | 28600043088 |
10 | 10331241551 |
11 | 4421797764 |
12 | 2003ab38bb |
13 | c885063a7 |
14 | 700149a11 |
15 | 406edd91b |
hex | 267ca3c4f |
10331241551 has 4 divisors (see below), whose sum is σ = 10506347400. Its totient is φ = 10156135704.
The previous prime is 10331241523. The next prime is 10331241559. The reversal of 10331241551 is 15514213301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10331241551 is a prime.
It is a Duffinian number.
It is a zygodrome in base 3.
It is a self number, because there is not a number n which added to its sum of digits gives 10331241551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331241559) 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 3 ways as a sum of consecutive naturals, for example, 87552836 + ... + 87552953.
It is an arithmetic number, because the mean of its divisors is an integer number (2626586850).
Almost surely, 210331241551 is an apocalyptic number.
10331241551 is a deficient number, since it is larger than the sum of its proper divisors (175105849).
10331241551 is an equidigital number, since it uses as much as digits as its factorization.
10331241551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175105848.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 10331241551 its reverse (15514213301), we get a palindrome (25845454852).
The spelling of 10331241551 in words is "ten billion, three hundred thirty-one million, two hundred forty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •