Base | Representation |
---|---|
bin | 100000010001101111110101… |
… | …1011001011100010111000101 |
3 | 1101020020221002211120011200002 |
4 | 1000203133223121130113011 |
5 | 244203122211123424023 |
6 | 2443500211550331045 |
7 | 113542056602541242 |
oct | 10043375331342705 |
9 | 1336227084504602 |
10 | 283914172483013 |
11 | 82511362815236 |
12 | 27a14575ab9a85 |
13 | c255cb768a4c7 |
14 | 501773ac2c5c9 |
15 | 22c53d4a9cb28 |
hex | 10237eb65c5c5 |
283914172483013 has 2 divisors, whose sum is σ = 283914172483014. Its totient is φ = 283914172483012.
The previous prime is 283914172482937. The next prime is 283914172483033. The reversal of 283914172483013 is 310384271419382.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144714596348644 + 139199576134369 = 12029738^2 + 11798287^2 .
It is a cyclic number.
It is not a de Polignac number, because 283914172483013 - 214 = 283914172466629 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 283914172483013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (283914172483033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 141957086241506 + 141957086241507.
It is an arithmetic number, because the mean of its divisors is an integer number (141957086241507).
Almost surely, 2283914172483013 is an apocalyptic number.
It is an amenable number.
283914172483013 is a deficient number, since it is larger than the sum of its proper divisors (1).
283914172483013 is an equidigital number, since it uses as much as digits as its factorization.
283914172483013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6967296, while the sum is 56.
The spelling of 283914172483013 in words is "two hundred eighty-three trillion, nine hundred fourteen billion, one hundred seventy-two million, four hundred eighty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •