Base | Representation |
---|---|
bin | 10010110010000101000… |
… | …01101010001000111011 |
3 | 2021200210022222111000121 |
4 | 21121002201222020323 |
5 | 41033144432322021 |
6 | 1212250322314111 |
7 | 64424436544243 |
oct | 11310241521073 |
9 | 2250708874017 |
10 | 645361214011 |
11 | 229772643018 |
12 | a50aa1b8937 |
13 | 48b1b64cb47 |
14 | 2334289cb23 |
15 | 11bc235c741 |
hex | 964286a23b |
645361214011 has 4 divisors (see below), whose sum is σ = 650287635624. Its totient is φ = 640434792400.
The previous prime is 645361214009. The next prime is 645361214021. The reversal of 645361214011 is 110412163546.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110412163546 = 2 ⋅55206081773.
It is a cyclic number.
It is not a de Polignac number, because 645361214011 - 21 = 645361214009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (645361214021) 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 3 ways as a sum of consecutive naturals, for example, 2463210610 + ... + 2463210871.
It is an arithmetic number, because the mean of its divisors is an integer number (162571908906).
Almost surely, 2645361214011 is an apocalyptic number.
645361214011 is a deficient number, since it is larger than the sum of its proper divisors (4926421613).
645361214011 is a wasteful number, since it uses less digits than its factorization.
645361214011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4926421612.
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 645361214011 its reverse (110412163546), we get a palindrome (755773377557).
The spelling of 645361214011 in words is "six hundred forty-five billion, three hundred sixty-one million, two hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •