Base | Representation |
---|---|
bin | 1111100011010000010… |
… | …01011100001101011011 |
3 | 1220002011220110110201102 |
4 | 13301220021130031123 |
5 | 32223243223000021 |
6 | 1045244213342015 |
7 | 53414012454545 |
oct | 7615011341533 |
9 | 1802156413642 |
10 | 534323250011 |
11 | 1966725aa221 |
12 | 8767b93790b |
13 | 3b5040b2b75 |
14 | 1bc0b8c8695 |
15 | dd7408500b |
hex | 7c6825c35b |
534323250011 has 4 divisors (see below), whose sum is σ = 534413773152. Its totient is φ = 534232726872.
The previous prime is 534323249981. The next prime is 534323250017. The reversal of 534323250011 is 110052323435.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110052323435 = 5 ⋅22010464687.
It is a cyclic number.
It is not a de Polignac number, because 534323250011 - 214 = 534323233627 is a prime.
It is a super-2 number, since 2×5343232500112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (534323250017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45252716 + ... + 45264521.
It is an arithmetic number, because the mean of its divisors is an integer number (133603443288).
Almost surely, 2534323250011 is an apocalyptic number.
534323250011 is a deficient number, since it is larger than the sum of its proper divisors (90523141).
534323250011 is an equidigital number, since it uses as much as digits as its factorization.
534323250011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90523140.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 534323250011 its reverse (110052323435), we get a palindrome (644375573446).
The spelling of 534323250011 in words is "five hundred thirty-four billion, three hundred twenty-three million, two hundred fifty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •