Base | Representation |
---|---|
bin | 110110101100011100111011… |
… | …1001011111110000101001001 |
3 | 2100002102120020022021221000222 |
4 | 1231120321313023332011021 |
5 | 1001024304124334230323 |
6 | 4423113330113035425 |
7 | 203223134325531233 |
oct | 15530716713760511 |
9 | 2302376208257028 |
10 | 481098466320713 |
11 | 12a32479403288a |
12 | 45b60132b55b75 |
13 | 1785a5105033a7 |
14 | 86b340bb17253 |
15 | 3a9471da699c8 |
hex | 1b58e772fe149 |
481098466320713 has 8 divisors (see below), whose sum is σ = 490184422270848. Its totient is φ = 472012829866864.
The previous prime is 481098466320601. The next prime is 481098466320721. The reversal of 481098466320713 is 317023664890184.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 481098466320713 - 210 = 481098466319689 is a prime.
It is a super-2 number, since 2×4810984663207132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (481098466320733) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76832945 + ... + 82858302.
It is an arithmetic number, because the mean of its divisors is an integer number (61273052783856).
Almost surely, 2481098466320713 is an apocalyptic number.
It is an amenable number.
481098466320713 is a deficient number, since it is larger than the sum of its proper divisors (9085955950135).
481098466320713 is a wasteful number, since it uses less digits than its factorization.
481098466320713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159748143.
The product of its (nonzero) digits is 41803776, while the sum is 62.
The spelling of 481098466320713 in words is "four hundred eighty-one trillion, ninety-eight billion, four hundred sixty-six million, three hundred twenty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •