Base | Representation |
---|---|
bin | 1001010010000110011101… |
… | …01111001000011011001011 |
3 | 2200021110220201211011111002 |
4 | 10221003032233020123023 |
5 | 10133422114140133423 |
6 | 111225401213525215 |
7 | 4204541651022221 |
oct | 451031657103313 |
9 | 80243821734432 |
10 | 20413153052363 |
11 | 6560195801345 |
12 | 23582577a380b |
13 | b50c4b9210a6 |
14 | 50800522ab11 |
15 | 255ed6365228 |
hex | 1290cebc86cb |
20413153052363 has 4 divisors (see below), whose sum is σ = 21300681445968. Its totient is φ = 19525624658760.
The previous prime is 20413153052351. The next prime is 20413153052387. The reversal of 20413153052363 is 36325035131402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20413153052363 - 238 = 20138275145419 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20413153052323) 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, 443764196768 + ... + 443764196813.
It is an arithmetic number, because the mean of its divisors is an integer number (5325170361492).
Almost surely, 220413153052363 is an apocalyptic number.
20413153052363 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20413153052363 is a deficient number, since it is larger than the sum of its proper divisors (887528393605).
20413153052363 is an equidigital number, since it uses as much as digits as its factorization.
20413153052363 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 887528393604.
The product of its (nonzero) digits is 194400, while the sum is 38.
Adding to 20413153052363 its reverse (36325035131402), we get a palindrome (56738188183765).
The spelling of 20413153052363 in words is "twenty trillion, four hundred thirteen billion, one hundred fifty-three million, fifty-two thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •