Base | Representation |
---|---|
bin | 1110000001000101011… |
… | …10000100110110000001 |
3 | 1201001010211211002022102 |
4 | 13000202232010312001 |
5 | 30342323410402321 |
6 | 1005130323120145 |
7 | 46536651413366 |
oct | 7004256046601 |
9 | 1631124732272 |
10 | 481618840961 |
11 | 176287309675 |
12 | 79411213055 |
13 | 36554c748cb |
14 | 1944bd3846d |
15 | c7dc088c0b |
hex | 7022b84d81 |
481618840961 has 8 divisors (see below), whose sum is σ = 502965092544. Its totient is φ = 460306447920.
The previous prime is 481618840957. The next prime is 481618841051. The reversal of 481618840961 is 169048816184.
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 481618840961 - 22 = 481618840957 is a prime.
It is a super-3 number, since 3×4816188409613 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 481618840897 and 481618840906.
It is not an unprimeable number, because it can be changed into a prime (481618840951) 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, 8435555 + ... + 8492456.
It is an arithmetic number, because the mean of its divisors is an integer number (62870636568).
Almost surely, 2481618840961 is an apocalyptic number.
It is an amenable number.
481618840961 is a deficient number, since it is larger than the sum of its proper divisors (21346251583).
481618840961 is a wasteful number, since it uses less digits than its factorization.
481618840961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16929271.
The product of its (nonzero) digits is 2654208, while the sum is 56.
The spelling of 481618840961 in words is "four hundred eighty-one billion, six hundred eighteen million, eight hundred forty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •