Base | Representation |
---|---|
bin | 101110000001010111111… |
… | …1111101010111100000101 |
3 | 211101200022012101202020112 |
4 | 1130002233333222330011 |
5 | 1312112344002012321 |
6 | 21241421543242405 |
7 | 1221655656462653 |
oct | 134025777527405 |
9 | 24350265352215 |
10 | 6325144563461 |
11 | 201952a234409 |
12 | 861a32149405 |
13 | 36b5c663c409 |
14 | 17c1d2589dd3 |
15 | ae7e8d72a5b |
hex | 5c0affeaf05 |
6325144563461 has 16 divisors (see below), whose sum is σ = 6489904389696. Its totient is φ = 6160887600000.
The previous prime is 6325144563377. The next prime is 6325144563469. The reversal of 6325144563461 is 1643654415236.
It is a happy number.
6325144563461 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 6325144563461 - 210 = 6325144562437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6325144563469) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175043366 + ... + 175079496.
It is an arithmetic number, because the mean of its divisors is an integer number (405619024356).
Almost surely, 26325144563461 is an apocalyptic number.
It is an amenable number.
6325144563461 is a deficient number, since it is larger than the sum of its proper divisors (164759826235).
6325144563461 is a wasteful number, since it uses less digits than its factorization.
6325144563461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42964.
The product of its digits is 6220800, while the sum is 50.
Adding to 6325144563461 its reverse (1643654415236), we get a palindrome (7968798978697).
The spelling of 6325144563461 in words is "six trillion, three hundred twenty-five billion, one hundred forty-four million, five hundred sixty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •