Base | Representation |
---|---|
bin | 100010101100001100111101… |
… | …1010000000111000011110011 |
3 | 1111000102022122112120212020102 |
4 | 1011120121323100013003303 |
5 | 304443422424432114103 |
6 | 3000552235522503015 |
7 | 121162543003215302 |
oct | 10530317320070363 |
9 | 1430368575525212 |
10 | 305142314332403 |
11 | 89256146440329 |
12 | 2a28275b804a6b |
13 | 10135a48680a12 |
14 | 554cd76d2a439 |
15 | 25426ba054e88 |
hex | 115867b4070f3 |
305142314332403 has 2 divisors, whose sum is σ = 305142314332404. Its totient is φ = 305142314332402.
The previous prime is 305142314332253. The next prime is 305142314332417. The reversal of 305142314332403 is 304233413241503.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 305142314332403 - 214 = 305142314316019 is a prime.
It is a super-2 number, since 2×3051423143324032 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (305142314332463) 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, 152571157166201 + 152571157166202.
It is an arithmetic number, because the mean of its divisors is an integer number (152571157166202).
Almost surely, 2305142314332403 is an apocalyptic number.
305142314332403 is a deficient number, since it is larger than the sum of its proper divisors (1).
305142314332403 is an equidigital number, since it uses as much as digits as its factorization.
305142314332403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 38.
Adding to 305142314332403 its reverse (304233413241503), we get a palindrome (609375727573906).
The spelling of 305142314332403 in words is "three hundred five trillion, one hundred forty-two billion, three hundred fourteen million, three hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •