Base | Representation |
---|---|
bin | 1110000110000111111001… |
… | …01100000001001100000001 |
3 | 11001202020221221121221101212 |
4 | 13003003330230001030001 |
5 | 13030322242142434234 |
6 | 145531410444535505 |
7 | 6346303462504625 |
oct | 703037454011401 |
9 | 131666857557355 |
10 | 30996723405569 |
11 | 9970700309069 |
12 | 3587457b51595 |
13 | 143ac9492bccc |
14 | 79236c58b185 |
15 | 38b468a625ce |
hex | 1c30fcb01301 |
30996723405569 has 2 divisors, whose sum is σ = 30996723405570. Its totient is φ = 30996723405568.
The previous prime is 30996723405553. The next prime is 30996723405577. The reversal of 30996723405569 is 96550432769903.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21407389283344 + 9589334122225 = 4626812^2 + 3096665^2 .
It is a cyclic number.
It is not a de Polignac number, because 30996723405569 - 24 = 30996723405553 is a prime.
It is a super-2 number, since 2×309967234055692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30996723405499 and 30996723405508.
It is not a weakly prime, because it can be changed into another prime (30996723405169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15498361702784 + 15498361702785.
It is an arithmetic number, because the mean of its divisors is an integer number (15498361702785).
Almost surely, 230996723405569 is an apocalyptic number.
It is an amenable number.
30996723405569 is a deficient number, since it is larger than the sum of its proper divisors (1).
30996723405569 is an equidigital number, since it uses as much as digits as its factorization.
30996723405569 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 330674400, while the sum is 68.
The spelling of 30996723405569 in words is "thirty trillion, nine hundred ninety-six billion, seven hundred twenty-three million, four hundred five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •