Base | Representation |
---|---|
bin | 1101110010001011011101… |
… | …11000000111001110001001 |
3 | 10222022202010200022010010102 |
4 | 12321011232320013032021 |
5 | 12433110314232130043 |
6 | 144244515121455145 |
7 | 6245633564246234 |
oct | 671055670071611 |
9 | 128282120263112 |
10 | 30311444411273 |
11 | 9727014174993 |
12 | 34966894a14b5 |
13 | 13bb48428643c |
14 | 76b12040441b |
15 | 37870c05e6b8 |
hex | 1b916ee07389 |
30311444411273 has 2 divisors, whose sum is σ = 30311444411274. Its totient is φ = 30311444411272.
The previous prime is 30311444411267. The next prime is 30311444411323. The reversal of 30311444411273 is 37211444411303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15415140668944 + 14896303742329 = 3926212^2 + 3859573^2 .
It is a cyclic number.
It is not a de Polignac number, because 30311444411273 - 222 = 30311440216969 is a prime.
It is not a weakly prime, because it can be changed into another prime (30311494411273) 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 as a sum of consecutive naturals, namely, 15155722205636 + 15155722205637.
It is an arithmetic number, because the mean of its divisors is an integer number (15155722205637).
Almost surely, 230311444411273 is an apocalyptic number.
It is an amenable number.
30311444411273 is a deficient number, since it is larger than the sum of its proper divisors (1).
30311444411273 is an equidigital number, since it uses as much as digits as its factorization.
30311444411273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
Adding to 30311444411273 its reverse (37211444411303), we get a palindrome (67522888822576).
The spelling of 30311444411273 in words is "thirty trillion, three hundred eleven billion, four hundred forty-four million, four hundred eleven thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •