Base | Representation |
---|---|
bin | 1101111001110011111101… |
… | …10111110111010011101001 |
3 | 11000020211002010100101010211 |
4 | 12330321332313313103221 |
5 | 13001404422140132401 |
6 | 145005211101141121 |
7 | 6303606634203025 |
oct | 674717667672351 |
9 | 130224063311124 |
10 | 30573705786601 |
11 | 981826595297a |
12 | 351948025a7a1 |
13 | 140a11b6a30b3 |
14 | 779abd431385 |
15 | 38045b528951 |
hex | 1bce7edf74e9 |
30573705786601 has 2 divisors, whose sum is σ = 30573705786602. Its totient is φ = 30573705786600.
The previous prime is 30573705786587. The next prime is 30573705786629. The reversal of 30573705786601 is 10668750737503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27345578490000 + 3228127296601 = 5229300^2 + 1796699^2 .
It is a cyclic number.
It is not a de Polignac number, because 30573705786601 - 27 = 30573705786473 is a prime.
It is a super-2 number, since 2×305737057866012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30573705786101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15286852893300 + 15286852893301.
It is an arithmetic number, because the mean of its divisors is an integer number (15286852893301).
Almost surely, 230573705786601 is an apocalyptic number.
It is an amenable number.
30573705786601 is a deficient number, since it is larger than the sum of its proper divisors (1).
30573705786601 is an equidigital number, since it uses as much as digits as its factorization.
30573705786601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22226400, while the sum is 58.
The spelling of 30573705786601 in words is "thirty trillion, five hundred seventy-three billion, seven hundred five million, seven hundred eighty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •