Base | Representation |
---|---|
bin | 100011001001100010110… |
… | …1111001011100111011001 |
3 | 122002211021222201110222200 |
4 | 1012103011233023213121 |
5 | 1113122100321024401 |
6 | 14135133342440413 |
7 | 1006006142415366 |
oct | 106230557134731 |
9 | 18084258643880 |
10 | 4830860720601 |
11 | 15a2835a33533 |
12 | 660305593109 |
13 | 290718560016 |
14 | 129b5a16346d |
15 | 859dd744686 |
hex | 464c5bcb9d9 |
4830860720601 has 12 divisors (see below), whose sum is σ = 6978072694320. Its totient is φ = 3220498691640.
The previous prime is 4830860720593. The next prime is 4830860720603. The reversal of 4830860720601 is 1060270680384.
4830860720601 is a `hidden beast` number, since 4 + 8 + 30 + 8 + 6 + 0 + 7 + 2 + 0 + 601 = 666.
It is not a de Polignac number, because 4830860720601 - 23 = 4830860720593 is a prime.
It is a super-2 number, since 2×48308607206012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4830860720603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5851495 + ... + 6625836.
It is an arithmetic number, because the mean of its divisors is an integer number (581506057860).
Almost surely, 24830860720601 is an apocalyptic number.
It is an amenable number.
4830860720601 is a deficient number, since it is larger than the sum of its proper divisors (2147211973719).
4830860720601 is a wasteful number, since it uses less digits than its factorization.
4830860720601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12520356 (or 12520353 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 45.
The spelling of 4830860720601 in words is "four trillion, eight hundred thirty billion, eight hundred sixty million, seven hundred twenty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •