Base | Representation |
---|---|
bin | 10101010001011011010… |
… | …00011010100111010011 |
3 | 2120212121101010120220010 |
4 | 22220231220122213103 |
5 | 43433400430303221 |
6 | 1315435254050003 |
7 | 103543426401132 |
oct | 12505550324723 |
9 | 2525541116803 |
10 | 730910009811 |
11 | 261a82711553 |
12 | b97a4349903 |
13 | 53c03221887 |
14 | 2753a553919 |
15 | 1402ca38c76 |
hex | aa2da1a9d3 |
730910009811 has 8 divisors (see below), whose sum is σ = 974784913344. Its totient is φ = 487154223080.
The previous prime is 730910009783. The next prime is 730910009833. The reversal of 730910009811 is 118900019037.
730910009811 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 730910009811 - 26 = 730910009747 is a prime.
It is a super-2 number, since 2×7309100098112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 730910009811.
It is not an unprimeable number, because it can be changed into a prime (730910009861) 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, 29764881 + ... + 29789426.
It is an arithmetic number, because the mean of its divisors is an integer number (121848114168).
Almost surely, 2730910009811 is an apocalyptic number.
730910009811 is a deficient number, since it is larger than the sum of its proper divisors (243874903533).
730910009811 is a wasteful number, since it uses less digits than its factorization.
730910009811 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59558401.
The product of its (nonzero) digits is 13608, while the sum is 39.
The spelling of 730910009811 in words is "seven hundred thirty billion, nine hundred ten million, nine thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •