Base | Representation |
---|---|
bin | 1101111001010011001011… |
… | …00011111010010101010011 |
3 | 11000012010122020022120212121 |
4 | 12330221211203322111103 |
5 | 13001112343410202111 |
6 | 144553140143035111 |
7 | 6302414450154334 |
oct | 674514543722523 |
9 | 130163566276777 |
10 | 30556101256531 |
11 | 9810851621974 |
12 | 3515b8859ba97 |
13 | 14085743891b6 |
14 | 778ccd34a28b |
15 | 37ec7ac3b871 |
hex | 1bca658fa553 |
30556101256531 has 2 divisors, whose sum is σ = 30556101256532. Its totient is φ = 30556101256530.
The previous prime is 30556101256489. The next prime is 30556101256559. The reversal of 30556101256531 is 13565210165503.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30556101256531 - 27 = 30556101256403 is a prime.
It is a super-2 number, since 2×305561012565312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30556101254531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15278050628265 + 15278050628266.
It is an arithmetic number, because the mean of its divisors is an integer number (15278050628266).
Almost surely, 230556101256531 is an apocalyptic number.
30556101256531 is a deficient number, since it is larger than the sum of its proper divisors (1).
30556101256531 is an equidigital number, since it uses as much as digits as its factorization.
30556101256531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 405000, while the sum is 43.
The spelling of 30556101256531 in words is "thirty trillion, five hundred fifty-six billion, one hundred one million, two hundred fifty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •