Base | Representation |
---|---|
bin | 100101011111101111111… |
… | …1101110001011100110001 |
3 | 200020122212221010022121111 |
4 | 1022333133331301130301 |
5 | 1133413202331103101 |
6 | 14543241110153321 |
7 | 1041215430204055 |
oct | 112773775613461 |
9 | 20218787108544 |
10 | 5153423300401 |
11 | 17076111159a2 |
12 | 6b2927052841 |
13 | 2b4c72936c5c |
14 | 13b5d9a4bc65 |
15 | 8e0bbb0c251 |
hex | 4afdff71731 |
5153423300401 has 4 divisors (see below), whose sum is σ = 5153475962404. Its totient is φ = 5153370638400.
The previous prime is 5153423300387. The next prime is 5153423300413. The reversal of 5153423300401 is 1040033243515.
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 2135295400225 + 3018127900176 = 1461265^2 + 1737276^2 .
It is a cyclic number.
It is not a de Polignac number, because 5153423300401 - 25 = 5153423300369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5153423360401) 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, 26183940 + ... + 26380021.
It is an arithmetic number, because the mean of its divisors is an integer number (1288368990601).
Almost surely, 25153423300401 is an apocalyptic number.
It is an amenable number.
5153423300401 is a deficient number, since it is larger than the sum of its proper divisors (52662003).
5153423300401 is an equidigital number, since it uses as much as digits as its factorization.
5153423300401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52662002.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 5153423300401 its reverse (1040033243515), we get a palindrome (6193456543916).
The spelling of 5153423300401 in words is "five trillion, one hundred fifty-three billion, four hundred twenty-three million, three hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •