Base | Representation |
---|---|
bin | 100010100110010010101110… |
… | …0100110111110010000011111 |
3 | 1110220112200001112121021022112 |
4 | 1011030211130212332100133 |
5 | 304342120421130204043 |
6 | 2555131143501304235 |
7 | 121050056243265566 |
oct | 10514453446762037 |
9 | 1426480045537275 |
10 | 304330051413023 |
11 | 88a72717177819 |
12 | 2a17125256507b |
13 | 100a727bc5583c |
14 | 55219200a6bdd |
15 | 252b4ca3aa518 |
hex | 114c95c9be41f |
304330051413023 has 2 divisors, whose sum is σ = 304330051413024. Its totient is φ = 304330051413022.
The previous prime is 304330051412957. The next prime is 304330051413041. The reversal of 304330051413023 is 320314150033403.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 304330051413023 - 28 = 304330051412767 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (304330051413523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152165025706511 + 152165025706512.
It is an arithmetic number, because the mean of its divisors is an integer number (152165025706512).
Almost surely, 2304330051413023 is an apocalyptic number.
304330051413023 is a deficient number, since it is larger than the sum of its proper divisors (1).
304330051413023 is an equidigital number, since it uses as much as digits as its factorization.
304330051413023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 32.
The spelling of 304330051413023 in words is "three hundred four trillion, three hundred thirty billion, fifty-one million, four hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •