Base | Representation |
---|---|
bin | 10010111001010110… |
… | …01100011010011111 |
3 | 222012000011021120112 |
4 | 21130223030122133 |
5 | 131234024332003 |
6 | 4354353240235 |
7 | 506253023102 |
oct | 113453143237 |
9 | 28160137515 |
10 | 10144761503 |
11 | 43364a9518 |
12 | 1b7156307b |
13 | c589a3b76 |
14 | 6c3486739 |
15 | 3e59553d8 |
hex | 25cacc69f |
10144761503 has 4 divisors (see below), whose sum is σ = 10146433128. Its totient is φ = 10143089880.
The previous prime is 10144761481. The next prime is 10144761533. The reversal of 10144761503 is 30516744101.
10144761503 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10144761503 - 232 = 5849794207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10144761503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10144761533) 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, 826676 + ... + 838857.
It is an arithmetic number, because the mean of its divisors is an integer number (2536608282).
Almost surely, 210144761503 is an apocalyptic number.
10144761503 is a deficient number, since it is larger than the sum of its proper divisors (1671625).
10144761503 is an equidigital number, since it uses as much as digits as its factorization.
10144761503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1671624.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 10144761503 in words is "ten billion, one hundred forty-four million, seven hundred sixty-one thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •