Base | Representation |
---|---|
bin | 1111011101110011110… |
… | …11000011000010010111 |
3 | 1212210122012022020120122 |
4 | 13232321323003002113 |
5 | 32201301430210203 |
6 | 1044042155222155 |
7 | 53251410344351 |
oct | 7567173030227 |
9 | 1783565266518 |
10 | 531400241303 |
11 | 195402645548 |
12 | 86ba4a4795b |
13 | 3b159647409 |
14 | 1ba116040d1 |
15 | dc5264d538 |
hex | 7bb9ec3097 |
531400241303 has 4 divisors (see below), whose sum is σ = 531426258528. Its totient is φ = 531374224080.
The previous prime is 531400241299. The next prime is 531400241327. The reversal of 531400241303 is 303142004135.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303142004135 = 5 ⋅60628400827.
It is a cyclic number.
It is not a de Polignac number, because 531400241303 - 22 = 531400241299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531400243303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12977951 + ... + 13018832.
It is an arithmetic number, because the mean of its divisors is an integer number (132856564632).
Almost surely, 2531400241303 is an apocalyptic number.
531400241303 is a deficient number, since it is larger than the sum of its proper divisors (26017225).
531400241303 is a wasteful number, since it uses less digits than its factorization.
531400241303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26017224.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 531400241303 its reverse (303142004135), we get a palindrome (834542245438).
The spelling of 531400241303 in words is "five hundred thirty-one billion, four hundred million, two hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •