Base | Representation |
---|---|
bin | 100001101101111111001… |
… | …1100100001111110011001 |
3 | 121102000210101222202120121 |
4 | 1003123332130201332121 |
5 | 1101411412332342040 |
6 | 13504535300153241 |
7 | 655545606655003 |
oct | 103337634417631 |
9 | 17360711882517 |
10 | 4634243637145 |
11 | 152740a79a631 |
12 | 62a192998821 |
13 | 278013064c15 |
14 | 120427483373 |
15 | 808322a0c4a |
hex | 436fe721f99 |
4634243637145 has 4 divisors (see below), whose sum is σ = 5561092364580. Its totient is φ = 3707394909712.
The previous prime is 4634243637143. The next prime is 4634243637151. The reversal of 4634243637145 is 5417363424364.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 652889856256 + 3981353780889 = 808016^2 + 1995333^2 .
It is a cyclic number.
It is not a de Polignac number, because 4634243637145 - 21 = 4634243637143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4634243637092 and 4634243637101.
It is not an unprimeable number, because it can be changed into a prime (4634243637143) 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, 463424363710 + ... + 463424363719.
It is an arithmetic number, because the mean of its divisors is an integer number (1390273091145).
Almost surely, 24634243637145 is an apocalyptic number.
It is an amenable number.
4634243637145 is a deficient number, since it is larger than the sum of its proper divisors (926848727435).
4634243637145 is an equidigital number, since it uses as much as digits as its factorization.
4634243637145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926848727434.
The product of its digits is 17418240, while the sum is 52.
The spelling of 4634243637145 in words is "four trillion, six hundred thirty-four billion, two hundred forty-three million, six hundred thirty-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •