Base | Representation |
---|---|
bin | 100000101111011111001… |
… | …0001110101011101111001 |
3 | 120221012100100101021211021 |
4 | 1001132332101311131321 |
5 | 1042212021403333101 |
6 | 13323140532302441 |
7 | 643054524164245 |
oct | 101367621653571 |
9 | 16835310337737 |
10 | 4500023105401 |
11 | 14854a380053a |
12 | 608174771a21 |
13 | 268472976235 |
14 | 117b33659425 |
15 | 7c0c8b545a1 |
hex | 417be475779 |
4500023105401 has 4 divisors (see below), whose sum is σ = 4516751816100. Its totient is φ = 4483294394704.
The previous prime is 4500023105371. The next prime is 4500023105411. The reversal of 4500023105401 is 1045013200054.
It is a happy number.
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 2721760850176 + 1778262255225 = 1649776^2 + 1333515^2 .
It is a cyclic number.
It is not a de Polignac number, because 4500023105401 - 211 = 4500023103353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4500023105411) 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, 8364354946 + ... + 8364355483.
It is an arithmetic number, because the mean of its divisors is an integer number (1129187954025).
Almost surely, 24500023105401 is an apocalyptic number.
It is an amenable number.
4500023105401 is a deficient number, since it is larger than the sum of its proper divisors (16728710699).
4500023105401 is a wasteful number, since it uses less digits than its factorization.
4500023105401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16728710698.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 4500023105401 its reverse (1045013200054), we get a palindrome (5545036305455).
The spelling of 4500023105401 in words is "four trillion, five hundred billion, twenty-three million, one hundred five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •